27. Remove Element-two pointers

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.

Hint：Try two pointers.

题目的意思就是删除指定的元素。题目很简单，但是如果每次找到一个元素，你都用vector.erase来删除，那么会比较慢，因为erase在删除时，要进行内存的移动，尤其在头部删除更费时。关于C++ vector, list, map, set的原理用法，见链接： http://blog.csdn.net/alex_xhl/article/details/37692297

题目中提到用two pointers，所以很简单的想到解法，代码如下：

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int i = 0, j = nums.size()-1;//two pointers
        while(i<=j){
            if(nums[i]==val){
                nums[i] = nums[j];
                nums.pop_back();
                j--;
            }
            else i++;
        }
        return j+1;
    }
};