用JavaScript实现的单链表的增删改查方法

 

 用JavaScript实现的:

class Node {
    constructor(data) {
        this.data = data
        this.next = null
    }
}
class SingleNode {
    constructor() {
        this.head = null
    }
    isEmpty() {
        return this.head === null
    }
    add(data) {
        let temp = new Node(data)
        temp.next = this.head
        this.head = temp
    }
    size() {
        let cur = this.head
        let count = 0
        while (cur != null) {
            count++
            cur = cur.next
        }
        return count
    }
    travel() {
        let cur = this.head
        while (cur != null) {
            console.log(cur.data);
            cur = cur.next
        }
    }
    search(data) {
        let cur = this.head
        let bool = false
        while (cur != null && !bool) {
            if (cur.data == data) {
                return true
            } else {
                cur = cur.next
            }
        }
        return bool
    }
    insert(data,item){
        let cur=this.head;
        let found=false,previous=null;
        while(cur!=null &&!found){
            if(cur.data===data){
                found=true
            }else{
                previous=cur
                cur=cur.next
            }
        }
        let temp=new Node(item)
        if(previous==null){
            temp.next=this.head
            this.head=temp
        }else{
            temp.next=cur
            previous.next=temp
        }
    }
    remove(data) {
        let cur = this.head
        let [previous, found] = [null, false]
        while (cur != null && !found) {
            if (cur.data === data) {
                found = true
            } else {
                previous = cur
                cur = cur.next
            }
        }
        if (previous == null) {
            this.head = cur.next
        } else {
            previous.next = cur.next
        }
    }
}
let node = new SingleNode();
node.add('连萌')
node.add('连裤袜')
node.add('赵婉彤')
node.insert('连萌','文博');
node.travel()

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值