diff --git "a/problems/0039.\347\273\204\345\220\210\346\200\273\345\222\214.md" "b/problems/0039.\347\273\204\345\220\210\346\200\273\345\222\214.md"
index 2a36ce5adb..cdf33c5812 100644
--- "a/problems/0039.\347\273\204\345\220\210\346\200\273\345\222\214.md"
+++ "b/problems/0039.\347\273\204\345\220\210\346\200\273\345\222\214.md"
@@ -311,7 +311,7 @@ class Solution:
 
         for i in range(startIndex, len(candidates)):
             if total + candidates[i] > target:
-                break
+                continue
             total += candidates[i]
             path.append(candidates[i])
             self.backtracking(candidates, target, total, i, path, result)
diff --git "a/problems/0200.\345\262\233\345\261\277\346\225\260\351\207\217.\345\271\277\346\220\234\347\211\210.md" "b/problems/0200.\345\262\233\345\261\277\346\225\260\351\207\217.\345\271\277\346\220\234\347\211\210.md"
index cd3ae70d71..5b9d90aa31 100644
--- "a/problems/0200.\345\262\233\345\261\277\346\225\260\351\207\217.\345\271\277\346\220\234\347\211\210.md"
+++ "b/problems/0200.\345\262\233\345\261\277\346\225\260\351\207\217.\345\271\277\346\220\234\347\211\210.md"
@@ -197,6 +197,7 @@ class Solution {
 }
 ```
 
+
 ### Python
 BFS solution 
 ```python
@@ -236,6 +237,7 @@ class Solution:
                     continue
                 q.append((next_i, next_j))
                 visited[next_i][next_j] = True
+
 ```
 
 <p align="center">
diff --git "a/problems/0200.\345\262\233\345\261\277\346\225\260\351\207\217.\346\267\261\346\220\234\347\211\210.md" "b/problems/0200.\345\262\233\345\261\277\346\225\260\351\207\217.\346\267\261\346\220\234\347\211\210.md"
index c30ace1999..f610e32330 100644
--- "a/problems/0200.\345\262\233\345\261\277\346\225\260\351\207\217.\346\267\261\346\220\234\347\211\210.md"
+++ "b/problems/0200.\345\262\233\345\261\277\346\225\260\351\207\217.\346\267\261\346\220\234\347\211\210.md"
@@ -218,6 +218,67 @@ class Solution {
     }
 }
 ```
+
+Python:
+
+```python
+# 版本一
+class Solution:
+    def numIslands(self, grid: List[List[str]]) -> int:
+        m, n = len(grid), len(grid[0])
+        visited = [[False] * n for _ in range(m)]
+        dirs = [(-1, 0), (0, 1), (1, 0), (0, -1)]  # 四个方向
+        result = 0
+
+        def dfs(x, y):
+            for d in dirs:
+                nextx = x + d[0]
+                nexty = y + d[1]
+                if nextx < 0 or nextx >= m or nexty < 0 or nexty >= n:  # 越界了，直接跳过
+                    continue
+                if not visited[nextx][nexty] and grid[nextx][nexty] == '1':  # 没有访问过的同时是陆地的
+                    visited[nextx][nexty] = True
+                    dfs(nextx, nexty)
+        
+        for i in range(m):
+            for j in range(n):
+                if not visited[i][j] and grid[i][j] == '1':
+                    visited[i][j] = True
+                    result += 1  # 遇到没访问过的陆地，+1
+                    dfs(i, j)  # 将与其链接的陆地都标记上 true
+
+        return result
+```
+
+```python
+# 版本二
+class Solution:
+    def numIslands(self, grid: List[List[str]]) -> int:
+        m, n = len(grid), len(grid[0])
+        visited = [[False] * n for _ in range(m)]
+        dirs = [(-1, 0), (0, 1), (1, 0), (0, -1)]  # 四个方向
+        result = 0
+
+        def dfs(x, y):
+            if visited[x][y] or grid[x][y] == '0':
+                return  # 终止条件：访问过的节点 或者 遇到海水
+            visited[x][y] = True
+            for d in dirs:
+                nextx = x + d[0]
+                nexty = y + d[1]
+                if nextx < 0 or nextx >= m or nexty < 0 or nexty >= n:  # 越界了，直接跳过
+                    continue
+                dfs(nextx, nexty)
+        
+        for i in range(m):
+            for j in range(n):
+                if not visited[i][j] and grid[i][j] == '1':
+                    result += 1  # 遇到没访问过的陆地，+1
+                    dfs(i, j)  # 将与其链接的陆地都标记上 true
+
+        return result
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
diff --git "a/problems/0674.\346\234\200\351\225\277\350\277\236\347\273\255\351\200\222\345\242\236\345\272\217\345\210\227.md" "b/problems/0674.\346\234\200\351\225\277\350\277\236\347\273\255\351\200\222\345\242\236\345\272\217\345\210\227.md"
index 0c5e64b34e..485e321c99 100644
--- "a/problems/0674.\346\234\200\351\225\277\350\277\236\347\273\255\351\200\222\345\242\236\345\272\217\345\210\227.md"
+++ "b/problems/0674.\346\234\200\351\225\277\350\277\236\347\273\255\351\200\222\345\242\236\345\272\217\345\210\227.md"
@@ -302,8 +302,9 @@ func findLengthOfLCIS(nums []int) int {
 }
 ```
 
-### Rust:
 
+### Rust:
+>动态规划
 ```rust
 pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
     if nums.is_empty() {
@@ -321,6 +322,27 @@ pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
 }
 ```
 
+
+> 贪心
+
+```rust
+impl Solution {
+    pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
+        let (mut res, mut count) = (1, 1);
+        for i in 1..nums.len() {
+            if nums[i] > nums[i - 1] {
+                count += 1;
+                res = res.max(count);
+                continue;
+            }
+            count = 1;
+        }
+        res
+    }
+}
+```
+
+
 ### Javascript：
 
 > 动态规划：