
class Solution {
public int removeElement(int[] nums, int val) {
int left = 0;
for(int right = 0;right<nums.length;right++){
if(nums[right] != val){
nums[left] = nums[right];
left++;
}
}
return left;
}
}







![[数据库]索引机制](https://img-blog.csdnimg.cn/direct/819611a8cd704d739d5100bfb8bbb341.png)











