Merge branch 'doocs:main' into main

Author: Nothing-avil

images/starcharts.svg

@@ -126,7 +126,7 @@ public:
         for (auto& e : graph) {
             g[e[0]].push_back(e[1]);
         }
-        function<bool(int)> dfs = [&](int i) {
+        auto dfs = [&](this auto&& dfs, int i) -> bool {
             if (i == target) {
                 return true;
             }

lcci/04.01.Route Between Nodes/README.md

@@ -134,7 +134,7 @@ public:
         for (auto& e : graph) {
             g[e[0]].push_back(e[1]);
         }
-        function<bool(int)> dfs = [&](int i) {
+        auto dfs = [&](this auto&& dfs, int i) -> bool {
             if (i == target) {
                 return true;
             }

lcci/04.01.Route Between Nodes/README_EN.md

@@ -6,7 +6,7 @@ class Solution {
         for (auto& e : graph) {
             g[e[0]].push_back(e[1]);
         }
-        function<bool(int)> dfs = [&](int i) {
+        auto dfs = [&](this auto&& dfs, int i) -> bool {
             if (i == target) {
                 return true;
             }
@@ -23,4 +23,4 @@ class Solution {
         };
         return dfs(start);
     }
-};
+};

lcci/04.01.Route Between Nodes/Solution.cpp

@@ -103,7 +103,7 @@ class Solution {
 class Solution {
 public:
     TreeNode* sortedArrayToBST(vector<int>& nums) {
-        function<TreeNode*(int, int)> dfs = [&](int l, int r) -> TreeNode* {
+        auto dfs = [&](this auto&& dfs, int l, int r) -> TreeNode* {
             if (l > r) {
                 return nullptr;
             }

lcci/04.02.Minimum Height Tree/README.md

@@ -24,19 +24,19 @@ Given sorted array: [-10,-3,0,5,9],
 
 
 
-One possible answer is: [0,-3,9,-10,null,5]，which represents the following tree: 
+One possible answer is: [0,-3,9,-10,null,5]，which represents the following tree:
 
 
 
-          0 
+          0
 
-         / \ 
+         / \
 
-       -3   9 
+       -3   9
 
-       /   / 
+       /   /
 
-     -10  5 
+     -10  5
 
 </pre>
 
@@ -127,7 +127,7 @@ class Solution {
 class Solution {
 public:
     TreeNode* sortedArrayToBST(vector<int>& nums) {
-        function<TreeNode*(int, int)> dfs = [&](int l, int r) -> TreeNode* {
+        auto dfs = [&](this auto&& dfs, int l, int r) -> TreeNode* {
             if (l > r) {
                 return nullptr;
             }

lcci/04.02.Minimum Height Tree/README_EN.md

@@ -10,7 +10,7 @@
 class Solution {
 public:
     TreeNode* sortedArrayToBST(vector<int>& nums) {
-        function<TreeNode*(int, int)> dfs = [&](int l, int r) -> TreeNode* {
+        auto dfs = [&](this auto&& dfs, int l, int r) -> TreeNode* {
             if (l > r) {
                 return nullptr;
             }
@@ -19,4 +19,4 @@ class Solution {
         };
         return dfs(0, nums.size() - 1);
     }
-};
+};

lcci/04.02.Minimum Height Tree/Solution.cpp

@@ -26,7 +26,7 @@ tags:
 
 <pre>
 <strong>输入: </strong>s = "abcabcbb"
-<strong>输出: </strong>3
+<strong>输出: </strong>3 
 <strong>解释:</strong> 因为无重复字符的最长子串是 <code>"abc"</code>，所以其长度为 3。
 </pre>
 

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md

@@ -278,6 +278,38 @@ var removeNthFromEnd = function (head, n) {
 };
 ```
 
+#### Swift
+
+````swift
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     public var val: Int
+ *     public var next: ListNode?
+ *     public init() { self.val = 0; self.next = nil; }
+ *     public init(_ val: Int) { self.val = val; self.next = nil; }
+ *     public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; }
+ * }
+ */
+class Solution {
+    func removeNthFromEnd(_ head: ListNode?, _ n: Int) -> ListNode? {
+        let dummy = ListNode(0)
+        dummy.next = head
+        var fast: ListNode? = dummy
+        var slow: ListNode? = dummy
+        for _ in 0..<n {
+            fast = fast?.next
+        }
+        while fast?.next != nil {
+            fast = fast?.next
+            slow = slow?.next
+        }
+        slow?.next = slow?.next?.next
+        return dummy.next
+    }
+}
+```
+
 #### Ruby
 
 ```rb
@@ -311,43 +343,34 @@ end
 #### PHP
 
 ```php
-# Definition for singly-linked list.
-# class ListNode {
-#     public $val;
-#     public $next;
-
-#     public function __construct($val = 0, $next = null)
-#     {
-#         $this->val = $val;
-#         $this->next = $next;
-#     }
-# }
-
+/**
+ * Definition for a singly-linked list.
+ * class ListNode {
+ *     public $val = 0;
+ *     public $next = null;
+ *     function __construct($val = 0, $next = null) {
+ *         $this->val = $val;
+ *         $this->next = $next;
+ *     }
+ * }
+ */
 class Solution {
     /**
      * @param ListNode $head
-     * @param int $n
+     * @param Integer $n
      * @return ListNode
      */
-
     function removeNthFromEnd($head, $n) {
-        $dummy = new ListNode(0);
-        $dummy->next = $head;
-
-        $first = $dummy;
-        $second = $dummy;
-
-        for ($i = 0; $i <= $n; $i++) {
-            $second = $second->next;
+        $dummy = new ListNode(0, $head);
+        $fast = $slow = $dummy;
+        for ($i = 0; $i < $n; $i++) {
+            $fast = $fast->next;
         }
-
-        while ($second != null) {
-            $first = $first->next;
-            $second = $second->next;
+        while ($fast->next !== null) {
+            $fast = $fast->next;
+            $slow = $slow->next;
         }
-
-        $first->next = $first->next->next;
-
+        $slow->next = $slow->next->next;
         return $dummy->next;
     }
 }
@@ -358,3 +381,4 @@ class Solution {
 <!-- solution:end -->
 
 <!-- problem:end -->
+````

solution/0000-0099/0019.Remove Nth Node From End of List/README.md

@@ -275,6 +275,38 @@ var removeNthFromEnd = function (head, n) {
 };
 ```
 
+#### Swift
+
+````swift
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     public var val: Int
+ *     public var next: ListNode?
+ *     public init() { self.val = 0; self.next = nil; }
+ *     public init(_ val: Int) { self.val = val; self.next = nil; }
+ *     public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; }
+ * }
+ */
+class Solution {
+    func removeNthFromEnd(_ head: ListNode?, _ n: Int) -> ListNode? {
+        let dummy = ListNode(0)
+        dummy.next = head
+        var fast: ListNode? = dummy
+        var slow: ListNode? = dummy
+        for _ in 0..<n {
+            fast = fast?.next
+        }
+        while fast?.next != nil {
+            fast = fast?.next
+            slow = slow?.next
+        }
+        slow?.next = slow?.next?.next
+        return dummy.next
+    }
+}
+```
+
 #### Ruby
 
 ```rb
@@ -308,43 +340,34 @@ end
 #### PHP
 
 ```php
-# Definition for singly-linked list.
-# class ListNode {
-#     public $val;
-#     public $next;
-
-#     public function __construct($val = 0, $next = null)
-#     {
-#         $this->val = $val;
-#         $this->next = $next;
-#     }
-# }
-
+/**
+ * Definition for a singly-linked list.
+ * class ListNode {
+ *     public $val = 0;
+ *     public $next = null;
+ *     function __construct($val = 0, $next = null) {
+ *         $this->val = $val;
+ *         $this->next = $next;
+ *     }
+ * }
+ */
 class Solution {
     /**
      * @param ListNode $head
-     * @param int $n
+     * @param Integer $n
      * @return ListNode
      */
-
     function removeNthFromEnd($head, $n) {
-        $dummy = new ListNode(0);
-        $dummy->next = $head;
-
-        $first = $dummy;
-        $second = $dummy;
-
-        for ($i = 0; $i <= $n; $i++) {
-            $second = $second->next;
+        $dummy = new ListNode(0, $head);
+        $fast = $slow = $dummy;
+        for ($i = 0; $i < $n; $i++) {
+            $fast = $fast->next;
         }
-
-        while ($second != null) {
-            $first = $first->next;
-            $second = $second->next;
+        while ($fast->next !== null) {
+            $fast = $fast->next;
+            $slow = $slow->next;
         }
-
-        $first->next = $first->next->next;
-
+        $slow->next = $slow->next->next;
         return $dummy->next;
     }
 }
@@ -355,3 +378,4 @@ class Solution {
 <!-- solution:end -->
 
 <!-- problem:end -->
+````