标签：oca har size val example return constant ace 难度
题目：
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
题解：
这个题和之前的题类似，难度不大
Solution 1 ()
class Solution { public: int removeElement(vector<int>& nums, int val) { int n = nums.size(); int cnt = 0; for(int i=0; i<n;i++) { if(nums[i] == val) cnt++; else { nums[i - cnt] = nums[i]; } } return n - cnt; } };
Solution 2 ()
class Solution { public: int removeElement(vector<int>& nums, int val) { int len = 0; for (int i = 0; i < nums.size(); ++i) { if (nums[i] != val) nums[len++] = nums[i]; } return len; } };
标签：oca har size val example return constant ace 难度
原文地址：http://www.cnblogs.com/Atanisi/p/6752342.html
