Leetcode–Remove Element

The Problem:

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.

Notes:

  1. Two pointer easy one.

Java Solution:

public class Solution {
    public int removeElement(int[] A, int elem) {
        if(A.length==0)return 0;
        int replace = 0;
        for(int i = 0; i < A.length; i++){
            if(A[i]==elem){
                continue;
            }
            else{
                A[replace] = A[i];
                replace++;
            }
        }
        return replace;
    }
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s