package LeetCode;
public class Test {
public static void main(String[] args) {
int[] nums1 = {1,1,2};
System.out.println(removeDuplicates(nums1));
int[] nums2 = {0,0,1,1,1,2,2,3,3,4};
System.out.println(removeDuplicates(nums2));
}
/**
* 采用外带的变量直接去重
*/
public static int removeDuplicates(int[] nums) {
if (nums.length == 0) {
return 0;
} else if (nums.length == 1) {
return 1;
}
int i = 0;
for (int j = 1; j < nums.length; j++) {
if (nums[i] != nums[j]) {
i++;
nums[i] = nums[j];
}
}
return i+1;
}
}