1 int removeDuplicates(int* nums, int numsSize) { 2 if (numsSize == 0) { 3 return 0; 4 } 5 6 int j = 1; 7 for (int i = 1; i < numsSize; i++) { 8 if (nums[i - 1] == nums[i]) { 9 continue; 10 } else { 11 nums[j] = nums[i]; 12 if (j <= numsSize - 1) { 13 j++; 14 } 15 } 16 17 } 18 19 return j; 20 }
注意:这道题说的是给定一个排序数组,所以不会出现[3,4,3,4]这种情况
链接:https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/submissions/
原文:https://www.cnblogs.com/yuxiang666/p/10713492.html