Remove Duplicates from Sorted Array

By | August 17, 2014

Question

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

My Solution

  public int removeDuplicates(int[] A) {
    if (A == null || A.length == 0) {
      return 0;
    }
    int length = 1;
    for(int i=1; i<A.length; i++) {
      if (A[i] != A[i-1]) {
        A[length] = A[i];
        length ++;
      }
    }
    return length;
  }

Leave a Reply

Your email address will not be published. Required fields are marked *