【leetcode每日刷題】Remove Duplicates from Sorted Array

Given a sorted array nums, 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 1:

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 returned length.      

Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length =          5, with the first five elements of          nums being modified to          0,          1         ,         2,          3, and          4         respectively.                                                                            

It doesn't matter what values are set beyond the returned length.      

class num26 {
    public int removeDuplicates(int[] nums) {
        if(nums.length == 0) return 0;
        int current = nums[0];
        int length = 1;
        for(int i=1;i<nums.length;i++){
            if(nums[i]==current) continue;
            else{
                current = nums[i];
                length += 1;
                nums[length-1] = current;
            }
        }
        return length;
    }
    public static void main(String[] args) {
        num26 s = new num26();
        int[] nums = new int[]{0,0,1,1,1,2,2,3,3,4};
        System.out.println(s.removeDuplicates(nums));
        for(int i=0; i<nums.length; i++){
            System.out.println(nums[i]);
        }
    }
}