首页 > 代码库 > [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]
.
基本思路:
与Remove Duplicates from Sorted Array方法类似。 可以参看《Remove Duplicates from Sorted Array》。
代码:
int removeDuplicates(int A[], int n) { //C++ if(n <=2) return n; int newp = 1, times = 0; for(int i = 1; i < n; i++) { if(A[i] == A[i-1]) { if(times == 0) { A[newp] = A[i]; newp++; times++; } } else { times = 0; A[newp] = A[i]; newp++; } } return newp; }
[leetcode]Remove Duplicates from Sorted Array II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。