leetcode第14题----- 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 by modifying the input array in-place with O(1) extra memory.

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

Example:

Given nums = [3,2,2,3], val = 3,

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

解题思路：

这道题和上道题很类似。题目要求不能另外申请空间来进行操作，只能在数组里面进行操作。所以，我的想法是每发现一个与val重复的数字，就把后面所有的数往前进一位，并且数组长度减1.

代码如下：

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
         int count = nums.size();
        if (count == 0)
            return 0;
        for (int i = 0; i < count; i++) {//与上道题改动的地方是 i=1 -> i = 0
            if (nums[i] == val) {//nums[i-1] -> val
                for (int j = i; j < count-1; j++) {
                    if (j < count-1)
                    nums[j] = nums[j+1];
                }
                count--;
                i--;
            }
        } 
        
        
        return count;
    }
};