题目描述:
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.
中文理解:给出一个数组,同时给一个指定的值,返回去除指定值后数组的长度,同时将非指定值的其他元素移动到前面的位置。比如1,2,3,2,3,4,指定值为2,则结果为1,3,3,4,结果数组的这四个值的顺序可以任意。
解题思路:设置一个变量count=0记录指定值的数量,遇到指定值则count++,否则nums[i-count]=nums[i],将非指定值的结果向前移动。
代码(java):
class Solution {
public int removeElement(int[] nums, int val) {
int count=0;
for(int i=0;i<nums.length;i++){
if(nums[i]==val){
count++;
}
else{
nums[i-count]=nums[i];
}
}
return nums.length-count;
}
}