Remove element from leetcode

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 arraynums=[3,2,2,3],val=3

Your function should return length = 2, with the first two elements ofnumsbeing 2.

Solution:

1. Double pointer problem.
2. corner case, if you are given [].

class Solution {

public:

int removeElement\(vector<int>& nums, int val\) {

    if \(nums.size\(\) == 0\) return 0; 



    int i = 0;

    for \(int j = 0; j < nums.size\(\); j++\) {

        if \(nums\[j\] != val\) {

            nums\[i\] = nums\[j\];

            i++;

        }

    }

    return i;

}

};