/*冒泡排序*/
var arr = [2, 3, 1, 0, 4, 8];
var temp = 0; //定义一个临时存储的变量
for (var i = 0; i < arr.length; i++) {
for (var j = 0; j < arr.length - i; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j + 1]
arr[j + 1] = arr[j]
arr[j] = temp
}
}
}
console.log(arr)
/*数组去重*/
var newArr = [1, 1, 2, 2, 3, 3] //源数组
var arr2 = []; //目标数组
for (var i = 0; i < newArr.length; i++) {
if (arr2.indexOf(newArr[i]) == -1) {
arr2.push(newArr[i])
}
}
console.log(arr2)
//使用includes
var arr3 = []
for (var i = 0; i < newArr.length; i++) {
if (!arr3.includes(newArr[i])) {
arr3.push(newArr[i])
}
}
console.log(arr3)
// 利用es6提供的Set来去重数据结构
var s=new Set(newArr)
var arr4=[]
arr4.push(...s)
console.log(arr4)
//老办法 使用双重for循环来去重数组
for(var i=0;i<newArr.length;i++){
for(var j=i+1;j<newArr.length;j++){
if(newArr[i]==newArr[j]){
newArr.splice(j,1); //重复了就删除一个
j--;
}
}
}
console.log(newArr)
//打印水仙花数
for(var i = 100; i < 1000; i++) {
var ge = parseInt(i % 10);
var shi = parseInt(i / 10 % 10);
var bai = parseInt(i / 10 / 10 % 10);
if(ge * ge * ge + shi * shi * shi + bai * bai * bai === i) {
console.log(i)
}
}
```