算法地址: https://leetcode.com/problems/remove-element/description/
解题思路:双指针
(1)使用左右指针开始移动
(2)停止条件到left > right 指针的时候
(3)如果left
class Solution {
public int removeElement(int[] nums, int val) {
int left = 0;
int right = nums.length-1;
while(left <= right){
if(nums[left] == val){
nums[left] = nums[right];
right--;
}else{
left++;
}
}
return left;
}
}