80. Remove Duplicates from Sorted Array II java solutions

最新推荐文章于 2024-11-29 23:52:24 发布

weixin_30411997

最新推荐文章于 2024-11-29 23:52:24 发布

阅读量61

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/guoguolan/p/5646890.html

本文探讨了在已排序数组中允许元素重复出现最多两次的情况下，如何移除多余的重复元素。通过一个具体示例说明了期望的输出结果，并提供了一个简洁的Java实现方案。

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array nums = [1,1,1,2,2,3],

Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn't matter what you leave beyond the new length.

Subscribe to see which companies asked this question

 1 public class Solution {
 2     public int removeDuplicates(int[] nums) {
 3         if(nums.length < 3) return nums.length;
 4         int s = 1;
 5         for(int i = 2; i < nums.length; i++){
 6             if(nums[i] != nums[s-1]) nums[++s] = nums[i];
 7         }
 8         return s+1;
 9     }
10 }