Remove Element
Given an array nums and a value val, 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.
Example 1:
Given nums = [3,2,2,3], val = 3,
Your function should return length = 2, with the first two elements of nums being 2.
It doesn’t matter what you leave beyond the returned length.
Example 2:
Given nums = [0,1,2,2,3,0,4,2], val = 2,
Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4.
Note that the order of those five elements can be arbitrary.
It doesn’t matter what values are set beyond the returned length.
该题目比较简单,不再解释,C语言代码如下:
int removeElement(int* a, int numsSize, int val) {
int j=0;
for(int i=0;i<numsSize;i++)
{
if(a[i]!=val)
a[j++]=a[i];
}
return j;
}
本文介绍了一个简单的算法问题RemoveElement,该问题要求在不使用额外空间的情况下,移除数组中所有指定值并返回新长度。文章提供了C语言实现代码,通过遍历数组并将非目标值元素前移来达到目的。

376

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



