Js单向链表

屿葤Yuan

已于 2023-04-24 23:17:28 修改

阅读量72

点赞数

分类专栏： js数据结构文章标签：链表 javascript 数据结构

于 2023-04-24 22:41:01 首次发布

本文链接：https://blog.csdn.net/weixin_41812196/article/details/130353973

版权

js数据结构专栏收录该内容

2 篇文章 0 订阅

订阅专栏

<!DOCTYPE html>
<html>
	<head>
		<meta charset="utf-8">
		<title></title>
	</head>
	<body>
		<script>
			class Node{
				constructor(value){
					this.value = value
					this.next = null
					this.pre = null
				}
			}
			class LinkedList{
				constructor(){
					this.size = 0
					this.head = null
				}
				
				findN(n){
					let currentnode = this.head
					
					while((n--)&&(currentnode.next)){
						currentnode = currentnode.next
					}
					
					return currentnode
				}
				append(element){
					let newnode = new Node(element)
					if(this.head == null){
						this.head = newnode
					}else{
						let currentnode = this.findN(this.size)
						currentnode.next = newnode
					}
					this.size++
				}
				
				find(item){
					//查找值为 item。、的节点
					let currentnode = this.head
					
					while(currentnode && currentnode.value!=item){
						currentnode = currentnode.next
					}
					
					return currentnode
				}
				
				insert(item,element){
					let currentnode = this.find(item)
					
					if(!currentnode){
						return "当前节点不存在"
					}
					let newnode = new Node(element)
					newnode.next = currentnode.next 
					currentnode.next = newnode
					this.size++
							
				}
				
				remove(item){
					let n = this.checkN(item)
					let nextnode = this.findN(n+1)
					let prenode =  this.findN(n-1)
					prenode.next = nextnode
					this.size--
				}
				checkN(item){
					//查询第几个item
					let currentnode = this.find(item)
					if(!currentnode){
						return -1
					}
					let res = this.head
					
					let count = 0
					while(res.value!=item){
						res = res.next
						count++
					}
					return count
				}
				isEmpty(){
				        // 判断链表是否为空 
				        return this.size == 0 
				    }
					
				getLength(){
				        // 获取链表的长度
				        return this.size
				    }
				    clear(){
				        // 清空链表
				        this.head = null
				        this.size = 0
				    }
			}
		</script>
		
		<script>
			class DoubleNode extends Node{
				constructor(element){
					super(element)
				}
			}
			class DoubleLinkedList extends LinkedList{
				constructor(){
					super()
					this.tail = null
				}
				
				append(element){
					const newnode = new DoubleNode(element)
					
					if(this.head == null){
						this.head = newnode
						this.tail = newnode
						newnode.pre = newnode
					}else{
						this.tail.next = newnode
						newnode.pre = this.tail
						this.tail = newnode
					}
					this.size++
				}
				
				insert(item,element){
					let n = this.checkN(item)
					let prenode = this.findN(n-1)
					let nextnode = this.findN(n+1)
					let newnode = new DoubleNode(element)
					
					if(n == this.size){
						this.tail = newnode
					}
					newnode.pre = prenode
					newnode.next = nextnode
					prenode.next = newnode
					nextnode.pre = newnode
					this.size++
				}
				
				remove(item){
					let n = this.checkN(item)
					
					let prenode = this.findN(n-1)
					let nextnode = this.findN(n+1)
					prenode.next = nextnode
					nextnode.pre = prenode
					this.size--
				}
				getHead(){
					return this.head
				}
				
				getTail(){
					return this.tail
				}
				
			}
			let arr = new DoubleLinkedList()
		</script>
	</body>
</html>