class Solution {
public int removeElement(int[] nums, int val) {
int left=0;
for(int i=0;i<nums.length;i++){
if(nums[i]==val){
continue; //一旦相等就重复,左边指针不动,i加一
}
nums[left++]=nums[i];
}
return left;
}
}
07-24
861
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-24
1406
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)