add js solution for leetcode 65 133 417

Author: swiftwind0405

README.md

@@ -98,6 +98,7 @@
 |438|[Find all Anagrams in a string](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | |Medium|
 |437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/) | |Medium|
 |418|[SentenceScreenFitting](https://leetcode.com/problems/sentence-screen-fitting/) ♥ | |Easy|
+|417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) | [js](./algorithms/pacificAtlanticWaterFlow/pacificAtlanticWaterFlow.js) |Medium|
 |416|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/description/) | |Medium|
 |415|[Add Strings](https://leetcode.com/problems/add-strings/) | |Easy|
 |414|[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/) | |Easy|
@@ -298,7 +299,7 @@
 |136|[Single Number](https://leetcode.com/problems/single-number/)| [java](./algorithms/singleNum/Solution.java)  |Medium|
 |135|[Candy](https://leetcode.com/problems/candy/)| |Hard|
 |134|[Gas Station](https://leetcode.com/problems/gas-station/)| |Medium|
-|133|[Clone Graph](https://leetcode.com/problems/clone-graph/)| |Medium|
+|133|[Clone Graph](https://leetcode.com/problems/clone-graph/)| [js](./algorithms/cloneGraph/cloneGraph.js) |Medium|
 |132|[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/)| |Hard|
 |131|[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/)| |Medium|
 |130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)| |Medium|
@@ -366,7 +367,7 @@
 |68|[Text Justification](https://leetcode.com/problems/text-justification/)| |Hard|
 |67|[Add Binary](https://leetcode.com/problems/add-binary/)| [java](./algorithms/addBinary/Solution.java) |Easy|
 |66|[Plus One](https://leetcode.com/problems/plus-one/)| |Easy|
-|65|[Valid Number](https://leetcode.com/problems/valid-number/)| |Easy|
+|65|[Valid Number](https://leetcode.com/problems/valid-number/)| [js](./algorithms/validNumber/validNumber.js)  |Easy|
 |64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)| |Medium|
 |63|[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/)| |Medium|
 |62|[Unique Paths](https://leetcode.com/problems/unique-paths/)| |Medium|

algorithms/cloneGraph/cloneGraph.js

@@ -0,0 +1,16 @@
+var cloneGraph = function (node) {
+    if (!node) return;
+    const visited = new Map();
+    const dfs = (n) => {
+        const nCopy = new Node(n.val);
+        visited.set(n, nCopy);
+        (n.neighbors || []).forEach(ne => {
+            if (!visited.has(ne)) {
+                dfs(ne);
+            }
+            nCopy.neighbors.push(visited.get(ne));
+        })
+    };
+    dfs(node);
+    return visited.get(node);
+};

algorithms/pacificAtlanticWaterFlow/pacificAtlanticWaterFlow.js

@@ -0,0 +1,46 @@
+var pacificAtlantic = function (matrix) {
+    if (!matrix || !matrix[0]) return [];
+
+    const m = matrix.length;
+    const n = matrix[0].length;
+    const flow1 = Array.from({ length: m }, () => new Array(n).fill(false));
+    const flow2 = Array.from({ length: m }, () => new Array(n).fill(false));
+
+    const dfs = (r, c, flow) => {
+        flow[r][c] = true;
+        [[r - 1, c], [r + 1, c], [r, c - 1], [r, c + 1]].forEach(([nr, nc]) => {
+            if (
+                // 保证在矩阵中
+                nr >= 0 && nr < m &&
+                nc >= 0 && nc < n &&
+                // 防止死循环
+                !flow[nr][nc] &&
+                // 保证逆流而上
+                matrix[nr][nc] >= matrix[r][c]
+            ) {
+                dfs(nr, nc, flow);
+            }
+        })
+    };
+
+    // 沿着海岸线逆流而上
+    for (let r = 0; r < m; r++) {
+        dfs(r, 0, flow1)
+        dfs(r, n - 1, flow2);
+    }
+    for (let c = 0; c < n; c++) {
+        dfs(0, c, flow1);
+        dfs(m - 1, c, flow2);
+    }
+
+    // 收集能流到两个大洋里的坐标
+    const res = [];
+    for(let r = 0; r < m; r++) {
+        for(let c = 0; c < n; c++) {
+            if(flow1[r][c] && flow2[r][c]) {
+                res.push([r, c])
+            }
+        }
+    }
+    return res;
+};

algorithms/validNumber/validNumber.js

@@ -0,0 +1,42 @@
+var isNumber = function (s) {
+    /**
+     * blank    空格
+     * sign     + -
+     * digit    0-9
+     * e        e
+     * .        .
+     */
+    const graph = {
+        0: { blank: 0, sign: 1, ".": 2, digit: 6 },
+        1: { digit: 6, ".": 2 },
+        2: { digit: 3 },
+        3: { digit: 3, e: 4 },
+        4: { digit: 5, sign: 7 },
+        5: { digit: 5 },
+        6: { digit: 6, ".": 3, e: 4 },
+        7: { digit: 5 },
+    };
+
+    let state = 0;
+
+    for (let c of s.trim()) {
+        if (c >= '0' && c <= '9') {
+            c = 'digit';
+        } else if (c === ' ') {
+            c = 'blank';
+        } else if (c === '+' || c === '-') {
+            c = 'sign';
+        }
+        // 如果得到的当前节点为 undefined 说明不在可用字符范围，直接返回false
+        if (graph[state] === undefined) return false;
+        state = graph[state][c];
+        // 如果得到的状态为 undefined 说明不在可用字符范围，也直接返回false
+        if (state === undefined) return false;
+    }
+
+    // 走到红色节点就为true
+    if ([3, 5, 6].includes(state)) {
+        return true;
+    }
+    return false;
+};