首页 > 代码库 > Leetcode-Remove Duplicates from Sorted Array II
Leetcode-Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?
For example,
Given sorted array A = [1,1,1,2,2,3],
Your function should return length = 5, and A is now [1,1,2,2,3].
Solution:
1 public class Solution { 2 public int removeDuplicates(int[] A) { 3 if (A.length==0) return 0; 4 5 int index =0; 6 int count = 0; 7 for (int i=0;i<A.length;i++){ 8 A[index] = A[i]; 9 if (i+1<A.length)10 if (A[i]!=A[i+1]){11 index++;12 count=0;13 } else if (count<1){14 index++;15 count++;16 }17 18 }19 return index+1;20 }21 }
Leetcode-Remove Duplicates from Sorted Array II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。