feat: add solutions to lc problem: No.3313 (#3623)

No.3313.Find the Last Marked Nodes in Tree

Author: yanglbme

lcof2/剑指 Offer II 101. 分割等和子串/README.md

@@ -166,13 +166,13 @@ class Solution {
         let target = s / 2
         var dp = Array(repeating: false, count: target + 1)
         dp[0] = true
-        
+
         for num in nums {
             for j in stride(from: target, through: num, by: -1) {
                 dp[j] = dp[j] || dp[j - num]
             }
         }
-        
+
         return dp[target]
     }
 }

lcof2/剑指 Offer II 102. 加减的目标值/README.md

@@ -171,13 +171,13 @@ class Solution {
         if target < -1000 || target > 1000 {
             return 0
         }
-        
+
         let n = nums.count
         var dp = Array(repeating: Array(repeating: 0, count: 2001), count: n)
-        
+
         dp[0][nums[0] + 1000] += 1
         dp[0][-nums[0] + 1000] += 1
-        
+
         for i in 1..<n {
             for j in -1000...1000 {
                 if dp[i - 1][j + 1000] > 0 {
@@ -186,7 +186,7 @@ class Solution {
                 }
             }
         }
-        
+
         return dp[n - 1][target + 1000]
     }
 }

lcof2/剑指 Offer II 105. 岛屿的最大面积/README.md

@@ -281,7 +281,7 @@ class Solution {
         var area = 1
         grid[i][j] = 0
         let dirs = [-1, 0, 1, 0, -1]
-        
+
         for k in 0..<4 {
             let x = i + dirs[k], y = j + dirs[k + 1]
             if x >= 0 && x < m && y >= 0 && y < n {

solution/1400-1499/1436.Destination City/README.md

@@ -30,7 +30,7 @@ tags:
 
 <pre>
 <strong>输入：</strong>paths = [["London","New York"],["New York","Lima"],["Lima","Sao Paulo"]]
-<strong>输出：</strong>"Sao Paulo"
+<strong>输出：</strong>"Sao Paulo" 
 <strong>解释：</strong>从 "London" 出发，最后抵达终点站 "Sao Paulo" 。本次旅行的路线是 "London" -&gt; "New York" -&gt; "Lima" -&gt; "Sao Paulo" 。
 </pre>
 

solution/1400-1499/1436.Destination City/README_EN.md

@@ -29,7 +29,7 @@ tags:
 
 <pre>
 <strong>Input:</strong> paths = [[&quot;London&quot;,&quot;New York&quot;],[&quot;New York&quot;,&quot;Lima&quot;],[&quot;Lima&quot;,&quot;Sao Paulo&quot;]]
-<strong>Output:</strong> &quot;Sao Paulo&quot;
+<strong>Output:</strong> &quot;Sao Paulo&quot; 
 <strong>Explanation:</strong> Starting at &quot;London&quot; city you will reach &quot;Sao Paulo&quot; city which is the destination city. Your trip consist of: &quot;London&quot; -&gt; &quot;New York&quot; -&gt; &quot;Lima&quot; -&gt; &quot;Sao Paulo&quot;.
 </pre>
 

solution/2100-2199/2161.Partition Array According to Given Pivot/README_EN.md

@@ -40,7 +40,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [9,12,5,10,14,3,10], pivot = 10
 <strong>Output:</strong> [9,5,3,10,10,12,14]
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 The elements 9, 5, and 3 are less than the pivot so they are on the left side of the array.
 The elements 12 and 14 are greater than the pivot so they are on the right side of the array.
 The relative ordering of the elements less than and greater than pivot is also maintained. [9, 5, 3] and [12, 14] are the respective orderings.
@@ -51,7 +51,7 @@ The relative ordering of the elements less than and greater than pivot is also m
 <pre>
 <strong>Input:</strong> nums = [-3,4,3,2], pivot = 2
 <strong>Output:</strong> [-3,2,4,3]
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 The element -3 is less than the pivot so it is on the left side of the array.
 The elements 4 and 3 are greater than the pivot so they are on the right side of the array.
 The relative ordering of the elements less than and greater than pivot is also maintained. [-3] and [4, 3] are the respective orderings.