263rd Commit

Author: Shyam-Chen

README.md

@@ -82,14 +82,15 @@ Problems:
 [334]: ./src/page-4/334.%20Increasing%20Triplet%20Subsequence/increasingTriplet.ts
 [443]: ./src/page-5/443.%20String%20Compression/compress.ts
 
-| Two Pointers                    |                  |        |      |
-| ------------------------------- | ---------------- | ------ | ---- |
-| 283. Move Zeroes                | [Solution][283]  | Easy   | 詳解 |
-| 392. Is Subsequence             | [Solution][392]  | Easy   | 詳解 |
-| 11. Container With Most Water   | [Solution][11]   | Medium | 詳解 |
-| 1679. Max Number of K-Sum Pairs | [Solution][1679] | Medium | 詳解 |
+| Two Pointers                    |                  |        |                         |
+| ------------------------------- | ---------------- | ------ | ----------------------- |
+| 283. Move Zeroes                | [Solution][283]  | Easy   | [詳解][283-explanation] |
+| 392. Is Subsequence             | [Solution][392]  | Easy   | 詳解                    |
+| 11. Container With Most Water   | [Solution][11]   | Medium | 詳解                    |
+| 1679. Max Number of K-Sum Pairs | [Solution][1679] | Medium | 詳解                    |
 
 [283]: ./src/page-3/283.%20Move%20Zeroes/moveZeroes.ts
+[283-explanation]: ./src/page-3/283.%20Move%20Zeroes/README.md
 [392]: ./src/page-4/392.%20Is%20Subsequence/isSubsequence.ts
 [11]: ./src/page-1/11.%20Container%20With%20Most%20Water/maxArea.ts
 [1679]: ./src/page-16/1679.%20Max%20Number%20of%20K-Sum%20Pairs/maxOperations.ts
@@ -778,15 +779,16 @@ Problems:
 [394]: ./src/page-4/394.%20Decode%20String/decodeString.ts
 [739]: ./src/page-7/739.%20Daily%20Temperatures/dailyTemperatures.ts
 
-| Two Pointers                  |                 |        |      |
-| ----------------------------- | --------------- | ------ | ---- |
-| 11. Container With Most Water | [Solution][11]  | Medium | 詳解 |
-| 15. 3Sum                      | Solution        | Medium | 詳解 |
-| 42. Trapping Rain Water       | Solution        | Hard   | 詳解 |
-| 283. Move Zeroes              | [Solution][283] | Easy   | 詳解 |
+| Two Pointers                  |                 |        |                         |
+| ----------------------------- | --------------- | ------ | ----------------------- |
+| 11. Container With Most Water | [Solution][11]  | Medium | 詳解                    |
+| 15. 3Sum                      | Solution        | Medium | 詳解                    |
+| 42. Trapping Rain Water       | Solution        | Hard   | 詳解                    |
+| 283. Move Zeroes              | [Solution][283] | Easy   | [詳解][283-explanation] |
 
 [11]: ./src/page-1/11.%20Container%20With%20Most%20Water/maxArea.ts
 [283]: ./src/page-3/283.%20Move%20Zeroes/moveZeroes.ts
+[283-explanation]: ./src/page-3/283.%20Move%20Zeroes/README.md
 
 | Trie                              |                 |        |      |
 | --------------------------------- | --------------- | ------ | ---- |

src/page-3/283. Move Zeroes/README.md

@@ -0,0 +1,40 @@
+# 283. 移動零 (Move Zeroes)
+
+給定一個整數陣列 `nums`，將所有 `0` 移至其末端，同時保持非零元素的相對順序。
+
+請注意，你必須在不複製陣列的情況下，在原位對陣列進行操作。
+
+範例 1：
+
+```coffee
+輸入: nums = [0,1,0,3,12]
+輸出: [1,3,12,0,0]
+```
+
+範例 2：
+
+```coffee
+輸入: nums = [0]
+輸出: [0]
+```
+
+## 解題
+
+```ts
+export const moveZeroes: MoveZeroes = (nums) => {
+  // 這將追蹤下一個非零數字應該去的索引
+  let nonZeroIndex = 0;
+
+  // 使用目前指標走訪陣列
+  for (let i = 0; i < nums.length; i++) {
+    // 如果目前元素不為 0
+    if (nums[i] !== 0) {
+      // 將其與 nonZeroIndex 處的元素交換
+      [nums[nonZeroIndex], nums[i]] = [nums[i], nums[nonZeroIndex]];
+
+      // 將非零指標移到下一個位置
+      nonZeroIndex += 1;
+    }
+  }
+};
+```