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