LeetCode.26(80) Remove Duplicates from Sorted Array

LeetCode.26 Remove Duplicates from Sorted Array

题目：

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,
Given input array nums = [1,1,2],

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

提示：

采用count记数重复个数，后面的元素直接往前移动count个位置即可。

分析：

public class Solution {
    public int removeDuplicates(int[] nums) {
        //移除已排好序数组中重复的数字（要求：不适用额外的数组空间，在常量内存空间完成操作）
        if(nums.length==0)return 0;
        //用来标记重复元素个数
        int len=0;
        for(int i=1;i<nums.length;i++){
            if(nums[i-1]==nums[i]){
                len++;
            }else{
                //不相同，将该元素赋值给下标为i-len
                nums[i-len]=nums[i];
            } 
        }
        //返回
        return nums.length-len;
    }
}

LeetCode.80 Remove Duplicates from Sorted Array

题目：

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.

提示：

跟前面除去重复元素类似，但是题目要求每个重复的元素最多出现两次，返回剩下数组的长度。

分析：

class Solution {
    public int removeDuplicates(int[] nums) {
        //移除多余的重复元素，每个重复元素最多出现两次
        if(nums.length==0||nums==null)
            return 0;
        int count=1;
        int index=0;
        for(int i=0;i<nums.length;i++){
            if(i>0&&nums[i]==nums[i-1]){
                //有相同的
                count++;
                //判断count是否超过2,超过就不再继续将该值赋给新数组
                if(count>2){
                    continue;
                }
                
            }else{
                //两者不相同,count初始化1
                count=1;
            }
            nums[index++]=nums[i];
        }
        //index即为新数组剩下的元素长度
        return index;
    }
}