27. Remove Element

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.

一开始看到这道题，就想起了另一道283. Move Zeroes。两道题基本是一样的，只不过改变了判断的val，所以程序只需要稍微更改。

public class Solution {    public int removeElement(int[] nums, int val) {        int i = 0, n = 0;        while (i < nums.length) {            if (nums[i] == val) {                n ++;            } else {                nums[i - n] = nums[i];            }            i ++;        }        return nums.length - n;    }}

在看Top Sulotion 时看到另一个更优的程序，记录在案：

int removeElement(int nums[], int val) {    int begin=0;    for(int i=0;i<nums.length;i++) if(nums[i]!=val) nums[begin++]=A[i];    return begin;}