[LeetCode] Remove Duplicates from Sorted Array

标签：style   blog   color   io   ar   for   div   cti   log   

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) {
        if (A.length == 0) return 0;
        
        int orgIndex = 1;
        int newIndex = 0;
        
        while(orgIndex < A.length) {
            if (A[newIndex] != A[orgIndex]) {
                A[++newIndex] = A[orgIndex];                
            }
            orgIndex++;
        }
        
        return newIndex+1;
    }
}

[LeetCode] Remove Duplicates from Sorted Array

标签：style   blog   color   io   ar   for   div   cti   log   

原文地址：http://www.cnblogs.com/yuhaos/p/3945992.html