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 class Solution {
public int removeElement(int[] A, int elem) {
int i = 0;
int pointer = A.length - 1;
while(i <= pointer){
if(A[i] == elem){
A[i] = A[pointer];
pointer--;
} else {
i++;
}
}
return pointer + 1;
}
}
本文介绍了一种在原地移除数组中特定值并返回新长度的算法实现。该算法不使用额外空间,并确保常数内存操作。通过一个具体示例展示了如何将指定元素从数组中删除,并保持剩余元素的顺序不变。
351

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



