- it技术
- 前端数组去重方法
<!DOCTYPE html
>
<html lang
="en">
<head
>
<meta charset
="UTF-8">
<meta name
="viewport" content
="width=device-width, initial-scale=1.0">
<title
>Document
</title
>
</head
>
<body
>
<script type
="text/javascript">
var arr
= [1,1,2,6,3,5,0,3,6,8,9,4,4,2,0,9,5,2,7,4,2,3,4,6];
function uniqueArr (array
) {
var _arr
= [],
isRepeat
;
for (var i
= 0; i
< array
.length
; i
++) {
isRepeat
= false;
for (var j
= 0; j
< _arr
.length
; j
++) {
if (_arr
[j
] == array
[i
]) {
isRepeat
= true;
break;
}
}
if (!isRepeat
) {
_arr
.push(array
[i
]);
}
}
return _arr
;
}
console
.log(uniqueArr(arr
).sort());
</script
>
</body
>
</html
>
<!DOCTYPE html
>
<html lang
="en">
<head
>
<meta charset
="UTF-8">
<meta name
="viewport" content
="width=device-width, initial-scale=1.0">
<title
>Document
</title
>
</head
>
<body
>
<script type
="text/javascript">
var arr
= [1,1,2,6,3,5,0,3,6,8,9,4,4,2,0,9,5,2,7,4,2,3,4,6];
function uniqueArr (array
) {
var _arr
= [],
isRepeat
;
for (var i
= 0; i
< array
.length
; i
++) {
isRepeat
= false;
for (var j
= i
+ 1; j
< array
.length
; j
++) {
if (array
[i
] == array
[j
]) {
isRepeat
= true;
break;
}
}
if (!isRepeat
) {
_arr
.push(array
[i
]);
}
}
return _arr
;
}
console
.log(uniqueArr(arr
).sort());
</script
>
</body
>
</html
>
