LeetCode——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].

今天心情不好，啥都不想写，题目很简单，见代码。

public int removeDuplicates(int[] A) {
        int len = 0;
        int temp;
        for (int i = 0; i < A.length; ) {
            temp = A[i];
            while (A[i] == temp) {
                i++;
                if (i == A.length)
                    break;
            }
            A[len] = temp;
            len++;
        }
        return len;
 }