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:
void swap(int &a, int &b){
int tmp = a;
a = b;
b =tmp;
}
int removeElement(vector<int>& nums, int val) {
if(nums.size() <= 0) return 0;
int p1=0, p2=nums.size()-1;
for(;p2>=0 && nums[p2]==val;p2--);
while(p1 < p2){
if(nums[p1] == val) swap(nums[p1], nums[p2--]);
for(;p2>=0 && nums[p2]==val;p2--); // don't forget this
p1++;
}
if(nums[p1] == val) return p1;
else return p1 + 1;
}
};
