LeetCode25: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 class Solution {    public int removeDuplicates(int[] A) {        // Start typing your Java solution below        // DO NOT write main() function        if(A.length<1)            return 0;        int curValue=A[0];        int curIndex=1;        for(int i=1; i<A.length; i++){            if(curValue!=A[i]){                curValue=A[i];                if(curIndex!=i)                    A[curIndex]=A[i];                curIndex++;            }        }        return curIndex;    }}

------------------------------------------------------------------------------------------------------------------------------------------

LL's solution:

public class Solution {    public int removeDuplicates(int[] A) {        // Start typing your Java solution below        // DO NOT write main() function        int len = A.length;        if(len<2)            return len;           int start = 0, window = 1;        int current = A[start];        while(start+window<len){            if(current<A[start+window]){                start++;                current = A[start];                if(window!=1){   // repeating                    window--;                    A[start] = A[start+window];                    current = A[start];                }            }            else{                window++;            }        }                return start+1;    }}