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

    Given a sorted array, 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 in place with constant memory.

    For example,
    Given input array 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 new length.

    此题和remove element很像,解法也类似,代码如下:

    public class Solution {

        public int removeDuplicates(int[] nums) {

            int idx = 0;

            for(int i=0;i<nums.length;i++){

                if(i!=0&&nums[i]==nums[i-1]) continue;

                nums[idx++] = nums[i];

            }

            return idx;

        }

    }

  • 相关阅读:
    linux 常用命令
    git 常见命令
    合并两个有序链表---python
    Code Contract for .NET
    Kruskal最小生成树算法
    逻辑-哲学
    停机问题
    逆向工程
    .net framework
    python 类库
  • 原文地址:https://www.cnblogs.com/codeskiller/p/6354138.html
Copyright © 2011-2022 走看看