Remove Element

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.

Thinking: We are only moving elements to the left, everywhere in between left and right pointers does not matter anymore because we will ignore them anyway.

public class Solution {
    public int removeElement(int[] A, int elem) {
        if (A.length == 0) return 0;
        int position = 0;
        for (int i = 0; i < A.length; i++) {
            A[position++] = A[i];
            if (A[i] == elem) position--;
        return position;

Leave a Reply

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

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

Google+ photo

You are commenting using your Google+ 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 )


Connecting to %s