zoukankan      html  css  js  c++  java
  • [LeetCode] 26. Remove Duplicates from Sorted Array

    Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns 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.

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

    Example 1:

    Input: nums = [1,1,2]
    Output: 2, nums = [1,2]
    Explanation: 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:

    Input: nums = [0,0,1,1,1,2,2,3,3,4]
    Output: 5, nums = [0,1,2,3,4]
    Explanation: 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.

    Constraints:

    • 0 <= nums.length <= 3 * 104
    • -104 <= nums[i] <= 104
    • nums is sorted in ascending order.

    删除排序数组中的重复项。

    给你一个有序数组 nums ,请你 原地 删除重复出现的元素,使每个元素 只出现一次 ,返回删除后数组的新长度。

    不要使用额外的数组空间,你必须在 原地 修改输入数组 并在使用 O(1) 额外空间的条件下完成。

    来源:力扣(LeetCode)
    链接:https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array
    著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。

    既然题目要求了不能用额外空间,所以思路是做两个指针,一个从nums[1]开始指向目前遍历到的数字,一个res指针指向0。如果当前数字nums[i] != nums[i - 1],则将nums[i]放入res所在的位置。

    时间O(n)

    空间O(1)

    Java实现

     1 class Solution {
     2     public int removeDuplicates(int[] nums) {
     3         // corner case
     4         if (nums == null || nums.length == 0) {
     5             return 0;
     6         }
     7 
     8         // normal case
     9         int res = 1;
    10         for (int i = 1; i < nums.length; i++) {
    11             if (nums[i - 1] != nums[i]) {
    12                 nums[res] = nums[i];
    13                 res++;
    14             }
    15         }
    16         return res;
    17     }
    18 }

    JavaScript实现

     1 /**
     2  * @param {number[]} nums
     3  * @return {number}
     4  */
     5 var removeDuplicates = function(nums) {
     6     // corner case
     7     if (!nums || nums.length === 0) {
     8         return 0;
     9     }
    10 
    11     // normal case
    12     let res = 1;
    13     for (let i = 1; i < nums.length; i++) {
    14         if (nums[i] !== nums[i - 1]) {
    15             nums[res] = nums[i];
    16             res++;
    17         }
    18     }
    19     return res;
    20 };

    LeetCode 题目总结

  • 相关阅读:
    关于FileUpload控件的二种用法,你都懂吗?
    Application全局对象 实现统计当前在线人数和总访问次数
    使用COOKIE对像实现保存用户基本信息(结合Session),ASP.Net实现用户登录全过程
    递规篇历路径之 使用正则过滤( 将符合正则的名称用另种正则格式替换掉 )某个路径下的所有文件或文件夹的完整路径
    小偷程序之网页分块筛选
    c#中的socket编程基础
    ASP.Net中的一些基础家常事
    PHP数组
    Effective C++总结
    构造函数、析构函数、虚函数可否内联,有何意义
  • 原文地址:https://www.cnblogs.com/cnoodle/p/12749219.html
Copyright © 2011-2022 走看看