---------------🎈🎈题目链接🎈🎈-------------------

解法1

时间复杂度O(N)
空间复杂度O(1)

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