feat: add solutions to lc problems: No.0417,0739

- No.0417.Pacific Atlantic Water Flow
- No.0739.Daily Temperatures

Author: YangFong

solution/0400-0499/0417.Pacific Atlantic Water Flow/README.md

@@ -281,6 +281,61 @@ func pacificAtlantic(heights [][]int) [][]int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function pacificAtlantic(heights: number[][]): number[][] {
+    const m = heights.length;
+    const n = heights[0].length;
+    const dirs = [
+        [1, 0],
+        [0, 1],
+        [-1, 0],
+        [0, -1],
+    ];
+    const gird = new Array(m).fill(0).map(() => new Array(n).fill(0));
+    const isVis = new Array(m).fill(0).map(() => new Array(n).fill(false));
+
+    const dfs = (i: number, j: number) => {
+        if (isVis[i][j]) {
+            return;
+        }
+        gird[i][j]++;
+        isVis[i][j] = true;
+        const h = heights[i][j];
+        for (const [x, y] of dirs) {
+            if (h <= (heights[i + x] ?? [])[j + y]) {
+                dfs(i + x, j + y);
+            }
+        }
+    };
+
+    for (let i = 0; i < n; i++) {
+        dfs(0, i);
+    }
+    for (let i = 0; i < m; i++) {
+        dfs(i, 0);
+    }
+    isVis.forEach(v => v.fill(false));
+    for (let i = 0; i < n; i++) {
+        dfs(m - 1, i);
+    }
+    for (let i = 0; i < m; i++) {
+        dfs(i, n - 1);
+    }
+
+    const res = [];
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (gird[i][j] === 2) {
+                res.push([i, j]);
+            }
+        }
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/0400-0499/0417.Pacific Atlantic Water Flow/README_EN.md

@@ -267,6 +267,61 @@ func pacificAtlantic(heights [][]int) [][]int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function pacificAtlantic(heights: number[][]): number[][] {
+    const m = heights.length;
+    const n = heights[0].length;
+    const dirs = [
+        [1, 0],
+        [0, 1],
+        [-1, 0],
+        [0, -1],
+    ];
+    const gird = new Array(m).fill(0).map(() => new Array(n).fill(0));
+    const isVis = new Array(m).fill(0).map(() => new Array(n).fill(false));
+
+    const dfs = (i: number, j: number) => {
+        if (isVis[i][j]) {
+            return;
+        }
+        gird[i][j]++;
+        isVis[i][j] = true;
+        const h = heights[i][j];
+        for (const [x, y] of dirs) {
+            if (h <= (heights[i + x] ?? [])[j + y]) {
+                dfs(i + x, j + y);
+            }
+        }
+    };
+
+    for (let i = 0; i < n; i++) {
+        dfs(0, i);
+    }
+    for (let i = 0; i < m; i++) {
+        dfs(i, 0);
+    }
+    isVis.forEach(v => v.fill(false));
+    for (let i = 0; i < n; i++) {
+        dfs(m - 1, i);
+    }
+    for (let i = 0; i < m; i++) {
+        dfs(i, n - 1);
+    }
+
+    const res = [];
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (gird[i][j] === 2) {
+                res.push([i, j]);
+            }
+        }
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/0400-0499/0417.Pacific Atlantic Water Flow/Solution.ts

@@ -0,0 +1,50 @@
+function pacificAtlantic(heights: number[][]): number[][] {
+    const m = heights.length;
+    const n = heights[0].length;
+    const dirs = [
+        [1, 0],
+        [0, 1],
+        [-1, 0],
+        [0, -1],
+    ];
+    const gird = new Array(m).fill(0).map(() => new Array(n).fill(0));
+    const isVis = new Array(m).fill(0).map(() => new Array(n).fill(false));
+
+    const dfs = (i: number, j: number) => {
+        if (isVis[i][j]) {
+            return;
+        }
+        gird[i][j]++;
+        isVis[i][j] = true;
+        const h = heights[i][j];
+        for (const [x, y] of dirs) {
+            if (h <= (heights[i + x] ?? [])[j + y]) {
+                dfs(i + x, j + y);
+            }
+        }
+    };
+
+    for (let i = 0; i < n; i++) {
+        dfs(0, i);
+    }
+    for (let i = 0; i < m; i++) {
+        dfs(i, 0);
+    }
+    isVis.forEach(v => v.fill(false));
+    for (let i = 0; i < n; i++) {
+        dfs(m - 1, i);
+    }
+    for (let i = 0; i < m; i++) {
+        dfs(i, n - 1);
+    }
+
+    const res = [];
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (gird[i][j] === 2) {
+                res.push([i, j]);
+            }
+        }
+    }
+    return res;
+}

solution/0700-0799/0739.Daily Temperatures/README.md

@@ -137,6 +137,26 @@ func dailyTemperatures(temperatures []int) []int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
+        let n = temperatures.len();
+        let mut stack = vec![];
+        let mut res = vec![0; n];
+        for i in 0..n {
+            while !stack.is_empty() && temperatures[*stack.last().unwrap()] < temperatures[i] {
+                let j = stack.pop().unwrap();
+                res[j] = (i - j) as i32;
+            }
+            stack.push(i);
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0700-0799/0739.Daily Temperatures/README_EN.md

@@ -113,6 +113,26 @@ func dailyTemperatures(temperatures []int) []int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
+        let n = temperatures.len();
+        let mut stack = vec![];
+        let mut res = vec![0; n];
+        for i in 0..n {
+            while !stack.is_empty() && temperatures[*stack.last().unwrap()] < temperatures[i] {
+                let j = stack.pop().unwrap();
+                res[j] = (i - j) as i32;
+            }
+            stack.push(i);
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0700-0799/0739.Daily Temperatures/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
+        let n = temperatures.len();
+        let mut stack = vec![];
+        let mut res = vec![0; n];
+        for i in 0..n {
+            while !stack.is_empty() && temperatures[*stack.last().unwrap()] < temperatures[i] {
+                let j = stack.pop().unwrap();
+                res[j] = (i - j) as i32;
+            }
+            stack.push(i);
+        }
+        res
+    }
+}