Remove Element Easy
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.
public int removeElement(int[] nums, int val) {
int j = 0;
for (int i = 0; i < nums.length; ++i) {
if (val != nums[i]) {
nums[j++] = nums[i];
}
}
return j;
}
思路:与上一题相同,顺序找与给定字符不同的,将其放到当前指针处,并计数。
本文介绍了一种在原地移除数组中特定值并返回新长度的高效算法,该算法不使用额外空间,通过一次遍历实现元素过滤,适用于需要节省内存的操作场景。
1618

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



