码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode Remove Duplicates from Sorted Array II

时间:2015-01-07 00:23:00      阅读:245      评论:0      收藏:0      [点我收藏+]

标签:

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

标签:

原文地址:http://www.cnblogs.com/birdhack/p/4207329.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!