题解 | #小A最多会新认识的多少人#

	let cannect = []
	let line = ''
class Tree{ //定义一个树
    constructor() {
        this.arr = []; //题目给的所有互相认识的人
        this.first = {}
    }
    set(key,toKey){ //往树中添加
        let toId = null
        function findeKey(obj) { //递归查找应该插入到哪里
            for(let item in obj){
                // console.log(item)
                if(item == key){
      
                    toId  = obj[item]

                }else{
                    findeKey(obj[item])
                }
            }
        }
        findeKey(this.first)

        toId[toKey] = {}


    }
    input(key,tokey){
        if(this.arr.includes(key)){
            if(!this.arr.includes(tokey)){
                this.arr.push(tokey)
            }
            this.set(key,tokey)
        }else if(this.arr.includes(tokey)){
            if(!this.arr.includes(tokey)){
                this.arr.push(key)
            }
            this.arr.push(key)
            this.set(tokey,key)
        }else{
            this.arr.push(key)
            this.arr.push(tokey)
            let obj = {}
            obj[tokey] = {}
            this.first[key] = obj
        }
    }
    getNewPeople(){ //获取与A相识的新人
        let oldPeople = 0
        find(this.first)
        function find(obj){
            for(let item in obj){
                if(item == numA){
                    oldPeople+=1
                }else {
                    find(obj[item])
                }
            }
        }

        console.log(this.arr.length-1-oldPeople) //减去自己和以前认识的人
    }
}
let treen = new Tree()

cannect.forEach(item=>{
    treen.input(item[0],item[1])
})
treen.getNewPeople()
//无法提交成功，因为内存消耗太大了，但也是一种办法
//大致的图