feat: update solutions to lcp problem: No.01, No.02

Author: thinkasany

lcp/LCP 01. 猜数字/README.md

@@ -105,7 +105,7 @@ func game(guess []int, answer []int) int {
 var game = function (guess, answer) {
     let ans = 0;
     for (let i = 0; i < 3; ++i) {
-        ans += guess[i] == answer[i];
+        ans += guess[i] === answer[i];
     }
     return ans;
 };

lcp/LCP 01. 猜数字/Solution.js

@@ -6,7 +6,7 @@
 var game = function (guess, answer) {
     let ans = 0;
     for (let i = 0; i < 3; ++i) {
-        ans += guess[i] == answer[i];
+        ans += guess[i] === answer[i];
     }
     return ans;
 };

lcp/LCP 02. 分式化简/README.md

@@ -128,7 +128,7 @@ func fraction(cont []int) []int {
  */
 var fraction = function (cont) {
     function dfs(i) {
-        if (i == cont.length - 1) {
+        if (i === cont.length - 1) {
             return [cont[i], 1];
         }
         const [a, b] = dfs(i + 1);

lcp/LCP 02. 分式化简/Solution.js

@@ -4,7 +4,7 @@
  */
 var fraction = function (cont) {
     function dfs(i) {
-        if (i == cont.length - 1) {
+        if (i === cont.length - 1) {
             return [cont[i], 1];
         }
         const [a, b] = dfs(i + 1);