LeetCode – Remove Duplicates from Sorted Array (Java)

上一篇博客我转了leetcode level of difficulty. 为了make life easy, 我打算严格按照题目的难度从简到难刷.

今天刷了difficulty为1的 Remove Duplicates from Sorted Array, 此题真的没啥难度, 就是維护两个pointer, 然后从头到尾遍历一遍就行. 但是由于各种想当然, 没有考虑好临界条件, leetcode runtime error了好几次才过

万事开头难, 加油了.

Code:

<pre name="code" class="java">public class Solution {
    public int removeDuplicates(int[] A) {
        int len = A.length;  
        if(len < 2){  
            return len;  
        } 
        int i = 0;
        int j = 1;
        while(j < len){
            if(A[i] == A[j]){
                j++;
            }else{
                i++;
                A[i] = A[j];
                j++;
            }
        }
        return i + 1;
    }
}

</pre>