class Solution { public int removeDuplicates(int[] nums) { int i= 1 ; // if(nums==null || nums.length == 1){ return nums.length;} for(int j = 0 ; j<nums.length-1; j++){ if (nums[j] != nums[j+1]){ nums[i] = nums[j+1]; //可修改为 nums[++i] = nums[j+1] ; 并去掉 i++ ; i++; } } return i ; } }
原文:https://www.cnblogs.com/try-chi/p/12012290.html