数组去重:
var arr = [1,2,3,4,5,3,4,6,8,1];编写程序去除数组内重复的值得到如下结果: arr = [1,2,3,4,5,6,8]
<script>
let arr = [1, 2, 3, 1, 2, 3, 1, 2, 3];
Array.prototype.myFun = function () {
let newArr = []
arr.forEach(function (item) {
// indexOf第一次出现的元素返回-1
let result = newArr.indexOf(item)
if (result === -1) {
newArr.push(item)
}
})
console.log(newArr);
}
arr.myFun();
</script>
数组升序:
参数格式:var arr = [8,19,3,12,5,4];
<script>
var arr = [1, 9, 4, 0, 6, 0, 11, 3, 2];
// 1.冒泡排序
function mySort(arr) {
// 外层循环控制比多少轮
for (var i = 0; i <= arr.length - 1; i++) {
// 内层循环控制一轮比较多少次
for (var j = 0; j <= arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
var temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
console.log(arr);
}
// mySort(arr);
// 2.原生sort方法排序
let newArr = arr.sort(function (a, b) {
return b - a
})
console.log(newArr);
</script>
数组内元素反转:
数组: [ 1, 2, 3, 4, 5, 6 ];
var arr = new Array[1, 2, 3, 4, 5, 6];
function eg1(arr){
var length = arr.length-1;
for(var i=0;i<arr.length/2;i++){
var temp = arr[i];
arr[i] = arr[length-i];
arr[length-i] = temp;
}
console.log(arr);
}
eg1(arr);