Javascript实现单链表简单操作

最新推荐文章于 2024-07-16 09:58:38 发布

anialy

最新推荐文章于 2024-07-16 09:58:38 发布

阅读量9.1k

点赞数

分类专栏：数据结构及算法 JavaScript 文章标签： javascript function list null action class

本文链接：https://blog.csdn.net/anialy/article/details/7732652

版权

JavaScript 同时被 2 个专栏收录

30 篇文章 0 订阅

订阅专栏

数据结构及算法

20 篇文章 0 订阅

订阅专栏

简述：

试用传引用方法，实现链表增加，移除，查找操作。

知识点：

javascript的function实现了类的封装

代码：

<!DOCTYPE html>
<html>
<head>
<script type = "text/javascript">
	var array = new Array(1,2,3,4,5,6);
	var Node = function(newData){
		this.next = null;
		this.data = null;
		this.Init = function(){
			this.data = newData;
		};
		this.Init();
	}
	//definition of List class 
	var List = function(){
		this.head = null;
		this.size = 0;
		this.Init = function(){
			this.head = null;
			this.size = 0;
		}
		this.Init();
		
		this.Insert = function(newData){
			this.size += 1;
			var newNode = new Node(newData);
			if(this.head == null){
				this.head = newNode;
				return;
			}
			var tempNode = this.head;
			while(tempNode.next != null)
				tempNode = tempNode.next;
			tempNode.next = newNode;
		};
		
		this.GetData = function(pos){
			if(pos >= this.size || pos < 0)
				return null;  
			else{
				tempNode = this.head;
				for(i = 0;i < pos;i++)  
					tempNode = tempNode.next;  
				return tempNode.data;  
			 }
		};
		
		//remove the element at pos
		this.Remove = function(pos){
			if(pos >= this.size || pos < 0)
				return null;  	
			this.size -= 1;
			tempNode = this.head;
			if(pos == 0){
				this.head = this.head.next;
				return this.head;
			}
			for(i = 0;i < pos - 1;i++){
				tempNode = tempNode.next;
			}
			tempNode.next = tempNode.next.next;
			return tempNode.next;
				
		}
		
		this.Print = function(){
			document.write("elements in list as follows: <br>");
			tempNode = this.head;
			while(tempNode != null){
				document.write(tempNode.data + " ");
				tempNode = tempNode.next;
			}
			document.write("<br>");
		};
	};
	
	//RUN TEST:
	var list = new List();
	var array = new Array(1,2,3,4,5,6);
	for(i = 0;i < array.length;i++){
		list.Insert(array[i]);
	}
	list.Print();
	document.write("now remove action: <br>");
	list.Remove(5);
	list.Print();
	document.write("new size after Remove list[5]:  " + list.size);

</script>
</head>

<body>
</body>
</html>

输出：

elements in list as follows:
1 2 3 4 5 6
now remove action:
elements in list as follows:
1 2 3 4 5
new size after Remove list[5]: 5

anialy

关注

0
点赞
踩
4

收藏

觉得还不错? 一键收藏
0
评论
Javascript实现单链表简单操作

简述：试用传引用方法，实现链表增加，移除，查找操作。知识点：javascript的function实现了类的封装代码： var array = new Array(1,2,3,4,5,6); var Node = function(newData){ this.next = null; this.data = null; this.Init
复制链接

扫一扫

专栏目录