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 A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

这是一道简单题。

题目没说清楚的是最终如何读题。最终是按照给定的length来读取A。

我一开始还在想着超出length后面的那些要如何处理呢？

整明白了就ok了。

上代码

public class Solution {
    public int removeDuplicates(int[] A) {
		int lengthA = A.length;
		// int now=A[0];
		int start = 0;
		for (int indexA = 1; indexA < A.length; ++indexA) {
			if (A[start] == A[indexA]) {// 相等的话，右边的左移。

				lengthA -= 1;
				// start=indexA;
			} else {
				if(start!=indexA+1){
					A[start+1]=A[indexA];
					start++;//空闲位置右移
				}
			//	start = indexA;
			}
		}
		return lengthA;}
}