package LeetCode.contact;

class Solution_26 {
    public int removeDuplicates(int[] nums) {
    	int count =0; //重复数的个数
    	for(int i = 1; i<nums.length-count;i++){  //当存在重复数时，数组前移，则检测的数也会减少
    		if(nums[i-1] == nums[i]){
    			for(int j = i;j<nums.length-count;j++){	//数组前移
    				nums[j-1] = nums[j];	
    			}
    			i--;
    			count++;		
    			}
    		
    	}
    	return nums.length-count;
    }
}

public class leetcode_26 {
	public static void main(String[] args){
		int[] arr = new int[]{0,0,1,1,1,2,2,3,3,4};
		Solution_26 so = new Solution_26();
		int a = so.removeDuplicates(arr);
		System.out.println(a);
		
	}

}