leetcode26:Remove Duplicates from Sorted Array

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.

因为数组是排序好的，所以当发现前后两个重复的数时，将后一个重复数的后面所有数向前移动，则重复数被后面覆盖，用一个标志deleteNumber记录移动的次数，下次循环时就只循环数组前nums.length-deleteNumber长度的数

package leetcode;

public class leet26 {
	
	public static void main(String[] args) {
		
		leet26 leet = new leet26();
		int[] array = {1,1,2,2,3,3,4,5,5};
		System.out.println(leet.removeDuplicates(array));
		
	}
	public int removeDuplicates(int[] nums){
		
		int deleteNumber = 0;//记录移动的次数
		for(int i = 0;i < nums.length-deleteNumber;i++){
			
			if(nums[i] == nums[i+1]){
				deleteNumber++;
				for(int j = i+1;j < nums.length-deleteNumber;j++){
					nums[j] = nums[j+1];
				}
				nums[nums.length - deleteNumber] = 0;
			}
		}
		return nums.length-deleteNumber;
	}
}