LeetCode之removeDuplicates

这个不复杂，原题如下：

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.

这里有个点：就是当取到的元素和给定的待删除的元素相等时，使用continue飘过

class Solution {public:    int removeElement(vector<int>& nums, int val) {        int i=0;        int j=0;        for(i=0;i<nums.size();i++)        {            if(nums[i]==val)            {                continue;            }            nums[j]=nums[i];            j++;        }        return j;    }};