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) {
int length = 0;
for (int i = 0; i < nums.length; i++) {
if (i > 0 && nums[i] == nums[length-1]) continue;
else {
nums[length] = nums[i];
length++;
}
}
return length;
}
}