-
Notifications
You must be signed in to change notification settings - Fork 0
/
多叉数找到对应节点.js
68 lines (64 loc) · 1.73 KB
/
多叉数找到对应节点.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
var cityData = [
{
id: 1,
name: '广东',
children: [
{
id: 2,
name: '北京',
children: [
{
id: 3,
name:'海淀',
}
]
}
]
}
]
// //根据ID找到name
// let result = ''
// const recursion = (cityData,id) => {
// if(!cityData||!cityData.length) return;
// for(let i = 0 ,len = cityData.length;i<len;i++){
// const childs = cityData[i].children
// if(cityData[i].id == id){
// result = cityData[i].name
// }
// if(child && childs.length>0){
// recursion(childs,id)
// }
// }
// return result
// }
// //广度优先遍历
// let result1 = ''
// const range = (cityData,id) => {
// if(!cityData || !cityData.length) return;
// let stack = [];
// let item = null
// for(let i = 0 ,len = cityData.length;i<len;i++){
// stack.push(cityData[i]);
// }
// while(stack.length){
// item = stack.shift();
// if(item.id === id){
// result = item.name
// }
// if(item.children && item.children.length){
// stack = stack.concat(item.children)
// //stack = item.children.concat(stack)如此写即为深度优先
// }
// }
// return result
// }
//正则
const regular = (cityData,id) => {
if(!cityData || !cityData.length) return;
let cityStr = JSON.stringify(cityData)
let reg = new RegExp(`"id":${id},"name":"([^\\x00-\\xff]+)",`)
let result = cityStr.match(reg)
console.log(result)
return (cityStr.match(reg))[1]
}
let r4 = regular(cityData,2)