算法题-用链表实现一个队列

interface ILinkList {
    value:number;
    next?:ILinkList;
}

export class Queue {
    private len = 0
    private head:ILinkList|undefined
    private tail:ILinkList|undefined
    add(data:number):number {
        const link = {
            value:data
        }
        if(!this.head){
            this.head = link
        }
        if(this.tail){
            // const footer = this.tail
            // footer.next = link
            this.tail.next = link
        }
        this.tail = link
        this.len++
        return this.len
    }
    delete():number|undefined{
        if(this.len<=0){
            return
        }
        const item = this.head
        this.head = this.head?.next
        this.len--
        return item?.value
    }
    get length(){
        return this.len
    }
}