Remove-duplicates-from-sorted-array

HowieLee59發表於2018-06-25
REM

題目描述


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

import java.util.*;
public class Solution {
    public int removeDuplicates(int[] A) {
        if(A == null || A.length == 0)
        {
            return 0;
        }
        int index = 0;
        SortedSet set = new TreeSet();
        for(int i : A)
        {
            if(!set.contains(i))
            {
                A[index++] = i;
                set.add(i);
            }
        }
        return index;
    }
}