leetcode-27. Remove Element

leetcode-27. 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) {
        int res = 0;
        for(int i = 0; i < nums.size(); ++i){
            if(nums[i]!=val){
                nums[res] = nums[i];
                res++;
            }
        }
        return res;
    }
};

有一个地方可以改进，res++这里

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

返回的是去重之后的长度还是去重之后的数组？