您的位置:首页 > Web前端 > JavaScript

[LeetCode][JavaScript]Remove Duplicates from Sorted Array

2015-10-18 17:14 232 查看

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.

https://leetcode.com/problems/remove-duplicates-from-sorted-array/

从有序数组中删除重复的元素。

/**
* @param {number[]} nums
* @return {number}
*/
var removeDuplicates = function(nums) {
var aRemove = [], i, previous;
for(i = 0; i < nums.length; i++){
if(nums[i] === previous){
aRemove.push(i);
}
previous = nums[i];
}
for(i = aRemove.length - 1; i >= 0; i--){
nums.splice(aRemove[i], 1);
}
return nums.length;
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: