Leetcode-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.

题目要求去掉数组中的给定数字，返回数组剩余数字的数量。难点在于，又又又是没有新的空间（当然，还是能够设置新的变量用于计数之类的），于是就要利用数组原有的空间了。新数组的数量一定小于或等于原数组的数量，可以用已经比较过的数组的位置，直接作为新数组。

class Solution {
    public int removeElement(int[] nums, int val) {
        int num = 0;
        for(int i = 0; i < nums.length; i++) {
        	if(nums[i] != val) {
        		nums[num++] = nums[i];
        	}
        }
        return num;
    }
}