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.

示例：

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.

问题分析：

本题目和Remove Duplicates from Sorted Array题目类似，这里不作过多介绍，直接上代码，有疑问的可以先看看我之前的Remove Duplicates from Sorted Array问题及解法

代码如下：

class Solution {public:    int removeElement(vector<int>& nums, int val) {        sort(nums.begin(),nums.end());        int i = 0;        for(int n : nums){ //这种方式在c++98模式下不支持         if(n != val) {nums[i++] = n;}}return i;     }};