<easy>LeetCode Problem -- 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 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，要求把数组中元素为val的值移除数组，并返回新数组长度。

• 思路一：使用stl。

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        return remove(nums.begin(), nums.end(), val) - nums.begin();
    }
};

• 思路二：由于题目中对于数字顺序无要求，用flag记录值为val的下标，因此当数组中元素值不为val时，用这个值替代下标为flag时的元素值。

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int flag = 0;
        for (int i = 0; i < nums.size(); i++) if (nums[i] != val) nums[flag++] = nums[i];
        return flag;
    }
};