题目 力扣代码 class Solution { public int removeElement(int[] nums, int val) { int left = 0; int right = nums.length; while (left < right) { if (nums[left] == val) { nums[left] = nums[right - 1]; right--; } else { left++; } } return left; } } 我的代码 class Solution { public int removeElement(int[] nums, int val) { int len=nums.length; if(len==0) return 0; int count=0; int end=len-1; for(int i=0;i>=0&&i<=end;i++){ while(end>=0&&nums[end]==val){ end--; count++; } if(end<0){ break; } if(nums[i]==val){ if(i<end){ nums[i]=nums[end]; nums[end]=val; end--; count++; } else{ break; } } } return len-count; } }