心得:双指针,感觉做的不好
class Solution { public int removeDuplicates(int[] nums) { int count=0; int tail=1; for(int i=1;i<nums.length;i++) { if(nums[i]==nums[i-1]) count++; else count=0; if(count>=2) continue; else nums[tail++]=nums[i]; } return tail; } }
心得:双指针,感觉做的不好
class Solution { public int removeDuplicates(int[] nums) { int count=0; int tail=1; for(int i=1;i<nums.length;i++) { if(nums[i]==nums[i-1]) count++; else count=0; if(count>=2) continue; else nums[tail++]=nums[i]; } return tail; } }