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
贴代码:int removeElement(int* nums, int numsSize, int val) {
int i = 0;
int rest = 0;
for (i = 0; i < numsSize; i++) {
if (nums[i] != val) {
nums[rest] = nums[i];
rest++;
}
}
return rest;
}
本文介绍了一个简单的算法,用于从整型数组中移除指定值的所有实例,并返回处理后的数组长度。该算法通过单次遍历实现,不使用额外的空间,符合原地修改的要求。

383

被折叠的 条评论
为什么被折叠?



