[leetcode]26. Remove Duplicates from Sorted Array

原题

26. Remove Duplicates from Sorted Array

 

Question
Editorial Solution
 My Submissions

Total Accepted: 167189
Total Submissions: 479303
Difficulty: Easy
Contributors: Admin

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.

Subscribe to see which companies
asked this question
用JavaScript做的，惊讶的发现没有Array.remove方法，只有spiice方法。
然后就是这道题有和隐藏boss就是nums的引用是不可改变的，否则不能AC。
时间度为n的方式当然是用一个Map对象，很常用的套路。
就是把结果返回的时候，没有更好的方式。因为当你在循环中spice元素的时候，index不断的变化了。

/**
* @param {number[]} nums
* @return {number}
*/

var Item = function() {
this.index = 0;
this.num = 0;
};

var removeDuplicates = function(nums) {
var map = new Map(), resultArray = [], result = 0 ,count = 0;
for(var i = 0; i< nums.length ; i++)
{
if(map.get(nums[i]) === undefined)
{
var o = new Item();
o.index = i;
o.num = 0;
map.set(nums[i],o);
//console.log(map.get(nums[i]));
resultArray.push(nums[i]);
result++;
}
else
{
var temp = map.get(nums[i]);
temp.num++;
map.set(nums[i],temp);
}
}

// console.log(map);

nums.splice(0, nums.length);
for(i=0;i

<span style="color:#ff0000;background-color: rgb(255, 255, 255);">

</span>