LeetCode27. 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(vector<int>& nums, int val) {        sort(nums.begin(),nums.end());        int size = count(nums.begin(),nums.end(),val);        vector<int>::iterator it = find(nums.begin(),nums.end(),val);        for (size;size>0;size--)        {            nums.erase(it);            it = find(nums.begin(),nums.end(),val);        }        return nums.size();    }};