原题:
// Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
// Do not allocate extra space for another array, you must do this in place with constant memory.
// For example,
// Given input array nums = [1,1,2],
// Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.
答案:
public class Solution {
public int removeDuplicates(int[] nums) {
if(nums.length == 0 || nums == null) return 0;
if(nums.length < 2) return nums.length;
int index = 1;
for(int i = 1; i < nums.length; i++) {
if(nums[i] != nums[i - 1]) {
nums[index++] = nums[i];
}
}
return index;
}
}