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.
public class Solution {
public int removeElement(int[] nums, int val) {
int len = 0;
for (int num : nums) {
if (num != val) {
nums[len] = num;
len++;
}
}
return len;
}
}
本文介绍了一种在数组中移除所有指定值的方法,并提供了一个简洁的Java代码实现。该方法通过遍历数组,将不等于指定值的元素重新放置到数组的前部,从而实现了原地移除。
435

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



