首页 > 代码库 > [leetcode]Remove Duplicates from Sorted Array II
[leetcode]Remove Duplicates from Sorted Array II
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].
算法思路：
跟[leetcode]Remove Duplicates from Sorted Array没太大区别，做一个标记即可。
代码：
1 public class Solution { 2 public int removeDuplicates(int[] A) { 3 if(A == null || A.length == 0) return 0; 4 int index = 1; 5 boolean twice = false; 6 for(int i = 1; i < A.length; i++){ 7 if(A[i] == A[i - 1] ){ 8 if(!twice){ 9 twice = true;10 A[index++] = A[i];11 }12 }else{13 twice = false;14 A[index++] = A[i];15 }16 }17 return index;18 }19 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。