80. Remove Duplicates from Sorte

作者: 夜皇雪 | 来源:发表于2016-12-17 04:46 被阅读0次

80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte

public class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums.length<=2) return nums.length;
        int count=2;
        for(int i=2;i<nums.length;i++){
            if(nums[i]!=nums[count-2]){
                nums[count++]=nums[i];
            }
        }
        return count;
    }
}

80. Remove Duplicates from Sorte
Problem Follow up for "Remove Duplicates":What if duplica...
80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte
简介 Follow up for "Remove Duplicates":What if duplicates a...
80. Remove Duplicates from Sorte
题目描述：与26题不同的是每个数字最多允许出现两次，同样返回处理后的长度。分析：同样因为已排好序，所以出现次数是...
80. Remove Duplicates from Sorte
题目描述：与83题不同的是若一个元素出现重复则将此元素全部删除，返回处理后的链表。如： Given 1->2->3...
80. Remove Duplicates from Sorte
Follow up for "Remove Duplicates":What if duplicates are ...
80. Remove Duplicates from Sorte
80. Remove Duplicates from Sorte
Follow up for "Remove Duplicates": What if duplicates are...
80. Remove Duplicates from Sorte
Follow up for "Remove Duplicates":What if duplicates are ...
80. Remove Duplicates from Sorte
题目 Follow up for "Remove Duplicates":What if duplicates a...