✨ [417] gpt's solution

Author: enkr1

417/gpt_solution.js

@@ -0,0 +1,76 @@
+// Runtime 117 ms Beats 81.9% Memory 51.5 MB Beats 48.34%
+/**
+ * @param {number[][]} heights
+ * @return {number[][]}
+ */
+const pacificAtlantic = (heights) => {
+  if (heights.length === 0 || heights[0].length === 0) {
+    return [];
+  }
+
+  const m = heights.length;
+  const n = heights[0].length;
+
+  const pacificQueue = []; // Queue for cells that can flow to the Pacific Ocean
+  const atlanticQueue = []; // Queue for cells that can flow to the Atlantic Ocean
+
+  // Initialize visited arrays for both oceans
+  const pacificVisited = Array.from({ length: m }, () => new Array(n).fill(false));
+  const atlanticVisited = Array.from({ length: m }, () => new Array(n).fill(false));
+
+  // Add border cells to the respective queues and mark them as visited
+  for (let i = 0; i < m; i++) {
+    pacificQueue.push([i, 0]);
+    atlanticQueue.push([i, n - 1]);
+    pacificVisited[i][0] = true;
+    atlanticVisited[i][n - 1] = true;
+  }
+  for (let j = 0; j < n; j++) {
+    pacificQueue.push([0, j]);
+    atlanticQueue.push([m - 1, j]);
+    pacificVisited[0][j] = true;
+    atlanticVisited[m - 1][j] = true;
+  }
+
+  // Perform BFS from the Pacific Ocean
+  bfs(pacificQueue, pacificVisited, heights);
+
+  // Perform BFS from the Atlantic Ocean
+  bfs(atlanticQueue, atlanticVisited, heights);
+
+  // Find cells that can flow to both oceans
+  const result = [];
+  for (let i = 0; i < m; i++) {
+    for (let j = 0; j < n; j++) {
+      if (pacificVisited[i][j] && atlanticVisited[i][j]) {
+        result.push([i, j]);
+      }
+    }
+  }
+
+  return result;
+};
+
+const bfs = (queue, visited, heights) => {
+  const m = heights.length;
+  const n = heights[0].length;
+  const directions = [[0, 1], [1, 0], [0, -1], [-1, 0]]; // Right, Down, Left, Up
+
+  while (queue.length > 0) {
+    const [row, col] = queue.shift();
+
+    for (const [dx, dy] of directions) {
+      const newRow = row + dx;
+      const newCol = col + dy;
+
+      // Check if the new cell is within bounds
+      if (newRow >= 0 && newRow < m && newCol >= 0 && newCol < n) {
+        // Check if the new cell is unvisited and its height is not greater than the current cell
+        if (!visited[newRow][newCol] && heights[newRow][newCol] >= heights[row][col]) {
+          visited[newRow][newCol] = true;
+          queue.push([newRow, newCol]);
+        }
+      }
+    }
+  }
+};

417/my_solution.js

@@ -51,7 +51,7 @@ const pacificAtlantic = (heights) => {
     if (oceanMap.get("p") && oceanMap.get("a")) {
       console.log(">>>>>>>>>>>>>>> This is the ONE!!!")
       console.log(oceanMap);
-      resultMap.set(start, true)
+      if (!resultMap.has(start)) resultMap.set(start, true)
       console.log(resultMap);
 
       return

417/solution.js

@@ -3,8 +3,6 @@
  * @return {number[][]}
  */
 const pacificAtlantic = (heights) => {
-  console.log(heights);
-
   if (heights.length === 1 && heights[0].length === 1) return [[0, 0]];
 
   let resultMap = new Map();
@@ -32,7 +30,7 @@ const pacificAtlantic = (heights) => {
 
     if (oceanMap.get("p") && oceanMap.get("a")) {
       resultMap.set(start, true)
-      return
+      return;
     }
 
     visitMap.set(coordinate, true)