Remove Element（easy）

【题目】

  Given an array and a value, remove all instances of that value in place and return the new length.

  Do not allocate extra space for another array, you must do this in place with constant memory.

  The order of elements can be changed. It doesn't matter what you leave beyond the new length.

 Example:
  Given input array nums = [3,2,2,3], val = 3

  Your function should return length = 2, with the first two elements of nums being 2.

【题意】

    给定一个数组和一个数值，去除这个数值所有出现位置，并返回新数组的长度。

【分析】

   把原数组A的元素依次诺入到新数组B中，必然有B的长度小于A的长度，因为可以利用在A当做B来用。

【实现】

public class Solution {
    public int removeElement(int[] A, int elem) {
        //{1,1,2,1,2,3,2,3,1}
        int newIndex = 0;
        for (int oldIndex = 0; oldIndex < A.length; ++oldIndex) {
            if (A[oldIndex] != elem) {
                A[newIndex++] = A[oldIndex];
            } 
        }
        return newIndex;
    }
}

public static int removeElement(int[] A, int elem) {
    ArrayList<Integer> list = new ArrayList<Integer>();
    for (int i = 0; i < A.length; i++) {
      if (A[i] == elem)
        continue;
      list.add(A[i]);
    }
    for (int i = 0; i < list.size(); i++)
      A[i] = list.get(i);
    return list.size();
  }