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