zoukankan      html  css  js  c++  java
  • LeetCode_26. Remove Duplicates from Sorted Array

    26. Remove Duplicates from Sorted Array

    Easy

    Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

    Example 1:

    Given 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 returned length.

    Example 2:

    Given nums = [0,0,1,1,1,2,2,3,3,4],
    
    Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
    
    It doesn't matter what values are set beyond the returned length.
    

    Clarification:

    Confused why the returned value is an integer but your answer is an array?

    Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

    Internally you can think of this:

    // nums is passed in by reference. (i.e., without making a copy)
    int len = removeDuplicates(nums);
    
    // any modification to nums in your function would be known by the caller.
    // using the length returned by your function, it prints the first len elements.
    for (int i = 0; i < len; i++) {
        print(nums[i]);
    }
    package leetcode.easy;
    
    public class RemoveDuplicatesFromSortedArray {
    	@org.junit.Test
    	public void test() {
    		int[] nums1 = { 1, 1, 2 };
    		int[] nums2 = { 0, 0, 1, 1, 1, 2, 2, 3, 3, 4 };
    		System.out.println(removeDuplicates(nums1));
    		System.out.println(removeDuplicates(nums2));
    	}
    
    	public int removeDuplicates(int[] nums) {
    		if (nums.length == 0) {
    			return 0;
    		}
    		int i = 0;
    		for (int j = 1; j < nums.length; j++) {
    			if (nums[j] != nums[i]) {
    				i++;
    				nums[i] = nums[j];
    			}
    		}
    		return i + 1;
    	}
    }
    
  • 相关阅读:
    求周期串的最小正周期
    Manacher's Algorithm
    高精度
    找x的两个素数因子使x=pq(Pollard_Rho)
    Intersection is not allowed!
    类欧几里得
    分数规划
    'sessionFactory' or 'hibernateTemplate' is required
    Struts2的动态方法,及result跳转方式,全局结果以及默认的action的配置
    配置Struts2及Struts2访问servlet api的方式
  • 原文地址:https://www.cnblogs.com/denggelin/p/11547139.html
Copyright © 2011-2022 走看看