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

    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.

     
     1 /**
     2  * @param {number[]} nums
     3  * @return {number}
     4  */
     5 var removeDuplicates = function(nums) {
     6 
     7       if(nums.length === 0 || nums.length === 1){
     8           return nums;
     9       }
    10     
    11   
    12      var pre = nums[0];
    13      var i = 1;
    14      while(i < nums.length){       
    15          if(pre === nums[i]){
    16              nums.splice(i,1);
    17          }else{
    18              
    19              pre = nums[i++]; 
    20          }    
    21      }
    22         
    23     return nums.length;
    24    
    25 };
  • 相关阅读:
    多窗口页面(Frames)
    页面(PAGE)标记(TAGS)
    表单(FORM)标记(TAGS)
    会移动的文字(Marquee)
    MediaPlayer控件的初探
    ADO.net实现数据库连接(1)
    ListView初认识
    TreeView控件
    初识敏捷开发
    新的征程
  • 原文地址:https://www.cnblogs.com/huenchao/p/7686013.html
Copyright © 2011-2022 走看看