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