zoukankan      html  css  js  c++  java
  • LeetCode Array Easy 26.Remove Duplicates from Sorted Array 解答及疑惑

    Description

    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]);
    }

    正确实现:

    public class Solution {
        public int RemoveDuplicates(int[] nums) {
            if(nums.Length == 0)
                return 0;
            int i,j = 0;
            for(i = 0; i < nums.Length; i++){
                if(nums[i] != nums[j])
                    nums[++j] = nums[i];
            }
            return j+1;
        }
    }

    我的疑惑:这样子实现会出现错误 数组越界 很是不解 但是后边再一次提交就通过了 

    public class Solution {
        public int RemoveDuplicates(int[] nums) {
            if(nums.Length == 0)
                return 0;
            int i,j = 0;
            for(i = 0; i < nums.Length -1; i++){
                if(nums[i] != nums[i+1])
                    nums[++j] = nums[i+1];
            }
            return j+1;
        }
    }
  • 相关阅读:
    where whereis locate find 的用法
    linux小知识
    linux touch和vi建立的文件是什么文件类型的
    linux创建文件的四种方式(其实是两种,强行4种)
    Linux mount实际使用
    linux文件系统和目录树的关系
    hard link && symbolic link
    Ext2文件系统的特点
    android pm命令
    linux安装源文件(.tar.gz)
  • 原文地址:https://www.cnblogs.com/c-supreme/p/8883744.html
Copyright © 2011-2022 走看看