给有序数组去重

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 count=1;
        int k = nums.length;
        if( k==1){
            return 1;
        }
        else{
        //如果此时i = i+1 那么此时的count则不会增加 而i会增加，去重

        for(int i=1;i<k;i++){
            if(nums[i] != nums[i-1]){
                nums[count++] = nums[i];
            }
        }
        return count;
        }
    }
}