问题描述:
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 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.
思路:
利用双指针,一个指针去进行数组的遍历,另一个指针表示其前面元素均为要留下的元素。遍历到某个元素为要删除元素时,继续搜索;如果不是当前元素,将元素移到另一指针的位置。遍历结束后,另一指针所指即为结果数组的长度。
代码:
class Solution {
public int removeElement(int[] nums, int val) {
if(nums == null) return 0;
int num = 0;
for(int i = 0; i < nums.length; i++){
if(nums[i] != val){
if(nums[num] != nums[i])
nums[num] = nums[i];
num++;
}
}
return num;
}
}