💀 [79]

Author: enkr1

79/my_solution.js

@@ -4,68 +4,75 @@
  * @return {boolean}
  */
 const exist = (board, word) => {
-  let doesExist = false;
+  // let doesExist = false;
   // , wordList = word.split("");
   // console.log(wordList);
   // wordList.shift()
   // console.log(wordList);
+  console.log(board);
+  console.log(word);
+  // let visit = Array.from({ length: board.length }, () => Array.from({ length: board[0].length }, () => 0))
+  let visit = new Set();
 
-  const expand = (r, c, visit, i) => {
+  const expand = (r, c, i) => {
     console.log(`r:${r}, c:${c}, i:${i}, visit:`)
     // console.log(wordList)
     console.log(visit)
+    console.log("visited?:" + visit.has(`${r}${c}`))
     // console.log(i)
     // console.log(word.length)
     // console.log(i === word.length)
 
     if (i === word.length) {
       console.log(">>>>>>>> >TRUE")
-      doesExist = true;
+      return true;
     }
 
     if (
       r === board.length ||
       c === board[0].length ||
       r < 0 ||
       c < 0 ||
-      1 === visit[r][c]
+      visit.has(`${r}${c}`) ||
+      word[i] !== board[r][c]
     ) {
-      return;
+      return false;
     }
 
-    if (word[i] !== board[r][c]) return;
-
-    console.log(`${word[i]} vs ${board[r][c]}`)
-    visit[r][c] = 1;
+    // visit[r][c] = 1;
+    visit.add(`${r}${c}`);
+    console.log(visit)
     i++
-    // wordList.shift();
-
-    // expand(r, c + 1, visit, wordList);
-    // expand(r + 1, c, visit, wordList);
-    // expand(r, c - 1, visit, wordList);
-    // expand(r - 1, c, visit, wordList);
-    expand(r, c + 1, visit, i);
-    expand(r + 1, c, visit, i);
-    expand(r, c - 1, visit, i);
-    expand(r - 1, c, visit, i);
+
+    let res = expand(r, c + 1, i) ||
+      expand(r + 1, c, i) ||
+      expand(r, c - 1, i) ||
+      expand(r - 1, c, i);
+
+    console.log("... Deleting visit")
+    console.log(visit)
+    visit.delete(`${r}${c}`);
+    console.log(visit)
+    return res;
+    // return expand(r, c + 1, i) ||
+    //   expand(r + 1, c, i) ||
+    //   expand(r, c - 1, i) ||
+    //   expand(r - 1, c, i);
   }
 
   // console.log(board)
   for (let r = 0; r < board.length; r++) {
     for (let c = 0; c < board[r].length; c++) {
-      if (!doesExist && word[0] === board[r][c]) {
+      if (word[0] === board[r][c]) {
         console.log(`>>>>> ${word[0]} === ${board[r][c]}`)
-        let visit = Array.from({ length: board.length }, () => Array.from({ length: board[0].length }, () => 0))
         // let wordList = word.split("");
         // expand(r, c, visit, wordList);
-        expand(r, c, visit, 0);
+        if (expand(r, c, 0)) return true;
       }
     }
   }
 
-  // console.log(board)
-
-  return doesExist;
+  return false;
 };
 
 let x = null;
@@ -77,11 +84,11 @@ let x = null;
 //   ["A", "D", "E", "E"]
 // ], "ABCCED")//true
 
-x = exist([
-  ["A", "B", "C", "E"],
-  ["S", "F", "E", "S"],
-  ["A", "D", "E", "E"]
-], "ABCEFSADEESE") // true
+// x = exist([
+//   ["A", "B", "C", "E"],
+//   ["S", "F", "E", "S"],
+//   ["A", "D", "E", "E"]
+// ], "ABCEFSADEESE") // true
 
 // x = exist(
 //   [
@@ -103,6 +110,13 @@ x = exist([
 //     ["a", "a", "a", "a"]
 //   ], "aaaaaaaaaaab") // false
 
+x = exist(
+  [
+    ["C", "A", "A"],
+    ["A", "A", "A"],
+    ["B", "C", "D"]
+  ], "AAB") // true
+
 
 console.log("Result")
 console.log(x)

79/solution.js

@@ -4,43 +4,40 @@
  * @return {boolean}
  */
 const exist = (board, word) => {
-  let doesExist = false;
+  let visit = new Set();
 
-  const expand = (r, c, visit, wordList) => {
-    if (0 === wordList.length) {
-      doesExist = true;
-    }
+  const expand = (r, c, i) => {
+    if (i === word.length) return true;
 
     if (
       r === board.length ||
       c === board[0].length ||
       r < 0 ||
       c < 0 ||
-      1 === visit[r][c]
-    ) {
-      return;
-    }
+      visit.has(`${r}${c}`) ||
+      word[i] !== board[r][c]
+    ) return false;
 
-    if (wordList[0] === board[r][c]) {
-      visit[r][c] = 1;
-      wordList.shift();
+    visit.add(`${r}${c}`);
+    i++
 
-      expand(r, c + 1, visit, wordList);
-      expand(r + 1, c, visit, wordList);
-      expand(r, c - 1, visit, wordList);
-      expand(r - 1, c, visit, wordList);
-    }
+    let res = expand(r, c + 1, i) ||
+      expand(r + 1, c, i) ||
+      expand(r, c - 1, i) ||
+      expand(r - 1, c, i);
+
+    visit.delete(`${r}${c}`);
+
+    return res;
   }
 
   for (let r = 0; r < board.length; r++) {
     for (let c = 0; c < board[r].length; c++) {
-      if (!doesExist && word[0] === board[r][c]) {
-        let visit = Array.from({ length: board.length }, () => Array.from({ length: board[0].length }, () => 0))
-        let wordList = word.split("");
-        expand(r, c, visit, wordList);
+      if (word[0] === board[r][c]) {
+        if (expand(r, c, 0)) return true;
       }
     }
   }
 
-  return doesExist;
+  return false;
 };