Monday, January 19, 2015

27. Remove Element Leetcode Java

Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
Solution:
This problem is very similar to 26. Remove Duplicates from Sorted Array Leetcode  Instead of maintaining an non-duplicates index, we maintain the index for the elements which are not equal to the target value. The code is also very similar.
 if(A==null || A.length==0) return 0;  
    int ind=0;  
    for(int i=0;i<A.length;i++){  
      if(A[i]!=elem){  
        A[ind]=A[i];  
        ind++;  
      }  
    }  
    return ind;  
   }  

No comments:

Post a Comment