function removeRep4(array){
var temp = []; //一个新的临时数组
for(var i = 0; i < array.length; i++){
if(temp.indexOf(array[i]) == -1){
temp.push(array[i]);
}
}
return temp;
}
var aa = [1,2,2,4,9,6,7,5,2,3,5,6,5];
console.log( removeRep4(aa));
6.利用数组中的filter方法(本方法转载他人)
var arr = ['apple','strawberry','banana','pear','apple','orange','orange','strawberry'];
3 var r = arr.filter(function(element,index,self){
4 return self.indexOf(element) === index;
5 });
6 console.log(r);
数组排序
一.reverse函数(数组反转,倒序)sort函数(十以内排序)
1..reverse 函数(数组反转,倒序)
var ary = [1,2,3,4,5];
var res = ary.reverse();返回一个倒叙后的数组,跟原数组是同一个地址,
自己写的倒序方法
①function myReverse(ary) {
for(var i = 0; i < ary.length/2 ; i++){
var temp = ary[i];
ary[i] = ary[ary.length -1 - i];
ary[ary.length -1 - i] = temp;
}
return ary;
}
②function myReverse2(ary) {
var arr = [];
// for(var i = 0; i < ary.length ; i++){
// arr.unshift(ary[i])
// }
for(var i = ary.length-1; i >= 0; i--){
arr.push(ary[i])
}
// ary = arr;
return arr;
}
function quickSort(ary) {
if (ary.length <= 1) {
return ary
};
var n = parseInt(ary.length / 2);
var cur = ary.splice(n, 1)[0];
var left = [], right = [];
for (var i = 0; i < ary.length; i++) {
if (ary[i] < cur) {
left.push(ary[i])
} else {
right.push(ary[i])
}
}return quickSort(left).concat(cur,quickSort(right));
}
var ary1=[5,3,6,9,2,4,8];
var temp =quickSort(ary1);
var temp =quickSort([]).concat(2,quickSort([5,3,7,8,4,2]))