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 by modifying the input array in-place with O(1) extra memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

代码如下: 3ms

int removeElement(int* nums, int numsSize, int val)
{
    int length = 0;
    
    for(int i = 0;i<numsSize;++i)
    {
        if(nums[i] != val)
        {
            nums[length] = nums[i];
            ++length;
        }
    }
    
    return length;
}