/*
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 by modifying the input array in-place with O(1) extra memory.
Example:
Given 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.
*/
class Solution {
public int removeDuplicates(int[] nums) {
int j = 0
for (int i = 1; i<nums.length; i++) {
if (nums[i] != nums[j])
nums[++j] = nums[i];
}
return j+1;
}
// 一个指针负责生成无重部分，另外一个指针负责遍历，这两个指针在一次遍历中共同完成任务。