-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy path026.删除排序数组中的重复项.js
74 lines (65 loc) · 1.36 KB
/
026.删除排序数组中的重复项.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
/**
* Created by Administrator on 2018/4/27.
*/
/**
* @param {number[]} nums
* @return {number}
*/
var removeDuplicates = function (nums) {
let map = {};
for (let i = 0; i < nums.length; i++) {
if (!map[nums[i]]) {
map[nums[i]] = true;
} else {
nums.splice(i, 1);
i--;
console.log(nums);
}
}
return nums;
};
let arr = [0, 0, 1, 1, 1, 2, 2, 3, 3, 4];
removeDuplicates([1,1,2])
// judge()
// 对数器
function judge() {
let correct = true;
for (let i = 0; i < 500000; i++) {
let arr = generateArr();
let arr1 = absoluteRight(arr);
let arr2 = removeDuplicates(arr);
if (arr1)
if (arr1.length !== arr2.length) return false;
for (let j = 0; j < arr1.length; j++) {
if (arr1[j] !== arr2[j]) {
console.log('wrong: ', arr);
correct = false;
break;
}
}
}
if (correct){
console.log('All correct!')
}
// 绝对正确的方法
function absoluteRight(nums) {
let map = {};
let arr1 = [];
for (let i = 0; i < nums.length; i++) {
if (!map[nums[i]]) {
map[nums[i]] = true;
arr1.push(nums[i])
}
}
return arr1;
}
}
// 数组生成器
function generateArr() {
let arr = [];
let len = Math.floor(Math.random() * 20);
for (let i = 0; i < len; i++) {
arr.push(Math.floor(Math.random() * 10))
}
return arr;
}