题目链接:https://leetcode.com/problems/remove-element/
Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
//遍历元素,如果需要删除,用数组最后一个元素填充当前元素;下一个循环依然考察当前元素
int removeElement(int* nums, int numsSize, int val) {
for(int i = 0; i < numsSize; ++i)
if(val == nums[i])
nums[i--] = nums[--numsSize];
return numsSize;
}