leetcode26: Remove Duplicates from Sorted Array

要求：

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.

两个指针，一个i用来指向那些保存下来的数据。j用来指向那些遍历数组得到的数据

public int removeDuplicates(int[] nums) {
int i = 1;
for (int j = 1; j < nums.length; j++) {
if (nums[j] != nums[j - 1]) {
nums[i] = nums[j];
i++;
}
}
return i;
}