Skip to content

Commit ea0d698

Browse files
committed
调整
1 parent 2d50235 commit ea0d698

File tree

2 files changed

+36
-9
lines changed

2 files changed

+36
-9
lines changed

listtree.js

Lines changed: 13 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -10,12 +10,22 @@ let list = [
1010
{ id: 8, name: '部门H', parentId: 4 }
1111
];
1212

13-
1413
function convert(list) {
1514
let tree = []
15+
// const map = list.reduce((res, v) => (res[v.id] = v, res), {})
1616
const map = list.reduce((res, v) => (res[v.id] = v, res), {})
17-
console.log(map)
18-
17+
18+
for(const item of list){
19+
if(item.parentId ===0 ){
20+
tree.push(item)
21+
continue
22+
}
23+
if(item.parentId in map){
24+
const parent = map[item.parentId]
25+
parent.children = parent.children || []
26+
parent.children.push(item)
27+
}
28+
}
1929

2030
return tree
2131
}

number.js

Lines changed: 23 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -64,9 +64,26 @@ function hander(obj){
6464
console.log(hander(obj))
6565

6666

67-
var arr = [1,2,3]
68-
for (let i = 0; i < arr.length; i++) {
69-
setTimeout(function(){
70-
console.log(i)
71-
},3000)
72-
}
67+
// var arr = [1,2,3]
68+
// for (let i = 0; i < arr.length; i++) {
69+
// setTimeout(function(){
70+
// console.log(i)
71+
// },3000)
72+
// }
73+
74+
75+
76+
// 中位数
77+
const num1 = [1,5],num2 = [4]
78+
let arrr = []
79+
arrr = arrr.concat(num1,num2)
80+
console.log(arrr)
81+
let nums = arrr.sort(function(a,b){return a-b})
82+
var median
83+
if(nums.length %2){
84+
median = nums[Math.floor(nums.length / 2)]
85+
}else{
86+
var m = nums.length / 2
87+
median = (nums[m - 1] + nums[m]) / 2
88+
}
89+
console.log(median)

0 commit comments

Comments
 (0)