[leet] 79. Word Search [mid]

Author: hyeonbinHur

허현빈/5주차/260128-1.js

@@ -0,0 +1,29 @@
+/**
+ * @param {number[][]} intervals
+ * @return {number[][]}
+ */
+var merge = function (intervals) {
+  const arr = intervals.sort((a, b) => {
+    if (a[0] !== b[0]) {
+      return a[0] - b[0];
+    } else {
+      return a[1] - b[1];
+    }
+  });
+  const ans = [];
+  let preStart = arr[0][0];
+  let preEnd = arr[0][1];
+  for (let i = 1; i < arr.length; i++) {
+    const start = arr[i][0];
+    const end = arr[i][1];
+    if (start > preEnd) {
+      ans.push([preStart, preEnd]);
+      preStart = start;
+      preEnd = end;
+    } else {
+      preEnd = Math.max(end, preEnd);
+    }
+  }
+  ans.push([preStart, preEnd]);
+  return ans;
+};

허현빈/5주차/260128-2.js

@@ -0,0 +1,50 @@
+/**
+ * @param {character[][]} board
+ * @param {string} word
+ * @return {boolean}
+ */
+var exist = function (b, w) {
+  const rows = b.length;
+  const cols = b[0].length;
+  const dir = [
+    [1, 0],
+    [-1, 0],
+    [0, 1],
+    [0, -1],
+  ];
+  const visit = Array.from({ length: rows }, () => Array(cols).fill(false));
+  const dfs = (y, x, count) => {
+    if (count === w.length) return true;
+
+    if (
+      y < 0 ||
+      y >= rows ||
+      x < 0 ||
+      x >= cols ||
+      visit[y][x] ||
+      b[y][x] !== w[count]
+    ) {
+      return false;
+    }
+
+    visit[y][x] = true;
+    for (let i = 0; i < 4; i++) {
+      const ny = y + dir[i][1];
+      const nx = x + dir[i][0];
+
+      if (dfs(ny, nx, count + 1)) return true;
+    }
+    visit[y][x] = false;
+    return false;
+  };
+
+  for (let i = 0; i < rows; i++) {
+    for (let j = 0; j < cols; j++) {
+      if (b[i][j] === w[0]) {
+        if (dfs(i, j, 0)) return true;
+      }
+    }
+  }
+
+  return false;
+};