zoukankan      html  css  js  c++  java
  • Java for LeetCode 080 Remove Duplicates from Sorted Array II

    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.

    解题思路:

    本题方法多多,这里采用另开一个数组的方法,JAVA实现如下:

        public int removeDuplicates(int[] nums) {
    		if (nums.length <= 2)
    			return nums.length;
    		int[] numsCopy = new int[nums.length];
    		numsCopy[0] = nums[0];
    		numsCopy[1] = nums[1];
    		int index = 2;
    		for (int i = 2; i < nums.length; i++) 
    			if (nums[i] != numsCopy[index - 2]) {
    				numsCopy[index] = nums[i];
    				index++;
    			}
    		for (int i = 0; i < index; i++)
    			nums[i] = numsCopy[i];
    		return index;
        }
    
  • 相关阅读:
    nyist 541最强DE 战斗力
    nyist 231 Apple Tree
    nyist 543 遥 控 器
    nyist 233 Sort it
    nyist 517 最小公倍数
    hdu 1sting
    nyist A+B Problem IV
    nyist 522 Interval
    nyist 117 求逆序数
    nyist 600 花儿朵朵
  • 原文地址:https://www.cnblogs.com/tonyluis/p/4513373.html
Copyright © 2011-2022 走看看