[leet code] Remove Element

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.

思路与Remove Duplicates from Sorted Array 完全一致且更加简单(这题目用来对比的int是固定的elem).

于是仍然是两个指针pointer是原数组指针, 无论何种情况, 每次加以; counter相当于是新数组(重用原来数组)的指针只有数组元素与给定elem值不同的时候才加一.  最后返回counter值作为所有与给定elem不等的数组元素数目.

public class Solution {
    public int removeElement(int[] A, int elem) {
        if(A.length == 0) return 0;
        
        int counter = 0;
        int pointer = 0;
        
        while (pointer < A.length){
            if (A[pointer] == elem)
                pointer++;
            else{
                counter++;
                A[counter-1] = A[pointer];
                pointer++;
            }
        }
        return counter;
    }
}