diff --git a/src/solution/Solution.java b/src/solution/Solution.java
index e0df66c..68a4b00 100644
--- a/src/solution/Solution.java
+++ b/src/solution/Solution.java
@@ -174,15 +174,10 @@ public class Solution {
      * 元素的 相对顺序 应该保持 一致 。然后返回 nums 中唯一元素的个数。
      */
     public static int removeDuplicates(int[] nums) {
-        int i = 0;
-        for (int j = 0; j < nums.length; j++) {
-            if (j == 0){
-                nums[i] = nums[j];
-                i++;
-                continue;
-            }
-            int preValue = nums[j - 1];
-            if (nums[j] != preValue){
+        if (nums.length == 0) return 0;
+        int i = 1;  // 从第二个元素开始检查
+        for (int j = 1; j < nums.length; j++) {
+            if (nums[j] != nums[j - 1]) {
                 nums[i] = nums[j];
                 i++;
             }