//å•å‘列表
class LinkedList{
constructor(){
this.head = null
}
insert(node){//O(1)
if(this.head!==null){
node.next = this.head
}
this.head = node
}
find(node){//))O(n)
let p = this.head
while(p&&p!==node){
p = p.next()
}
return p
}
}
//队列
class Queue {
enqueue(item){
if(this.size===this.max){
throw 'Queue Overflow'
}
this.data[this.p++] = item
this.size++
if(this.p == this.max){
this.p = 0
}
}
dequeue(){
if(this.size==0){
throw 'Queue Underflow'
}
const item = this.data[this.q++]
this.size--
if(this.q===this.max){
this.q=0
}
return item
}
}
//å转二å‰æ ‘
function reverseBTress(node){
if(!node){
return
}
const tmp = node.left
node.left = node.right
node.right = tmp
reverseBTress(node.right)
reverseBTress(node.left)
}
//a.name=ramroll&a.dress&x=1&y=
function parse(str){
return str.split('&').reduce((o,kv)=>{
const [key,value] = kv.split('=')
if(!value){
return o
}
// o[key] = value
deep_set(o,kv.split(/[\[\]]/g).filter(x=>x),value)
return o
},{})
}
function deep_set(o,path,value){
debugger
let i = 0;
for(;i