提交代码与更新文档

623846108 · Jul 19, 2019 · 725ff7e · 725ff7e
1 parent 5aa4203
commit 725ff7e
Show file tree

Hide file tree

Showing 17 changed files with 1,705 additions and 14 deletions.
diff --git a/0. arr.html b/0. arr.html
@@ -0,0 +1,30 @@
+<!DOCTYPE html>
+<html lang="en">
+	<head>
+		<meta charset="UTF-8" />
+		<meta name="viewport" content="width=device-width, initial-scale=1.0" />
+		<meta http-equiv="X-UA-Compatible" content="ie=edge" />
+		<title>JavaScript 数据结构与算法之美 - 数组</title>
+	</head>
+	<body></body>
+	<script>
+		let str = 'string';
+		str = 123;
+		console.log(str); //   123
+
+		let a = 123;
+		let b = '456';
+		let c = a + b;
+		// 数值加字符串，结果是字符串
+		console.log(c); //   "123456"
+
+		// 数组的类型有 数值、字符串，还可以随意变更类型
+		const arr = [12, 34, 'abc'];
+		arr[2] = { key: 'value' }; // 把数组的第二项变成对象
+		console.log(arr); //  [ 12, 34,  { "key": "value"} ]
+
+		const arr2 = [12, 34, 'abc'];
+		arr2.push({ key: 'value' }); // 添加一项 对象
+		console.log(arr2); //  [ 12, 34, "abc", { "key": "value" } ]
+	</script>
+</html>
diff --git a/1. singly-linked-list.html b/1. singly-linked-list.html
@@ -0,0 +1,190 @@
+<!DOCTYPE html>
+<html lang="en">
+	<head>
+		<meta charset="UTF-8" />
+		<meta name="viewport" content="width=device-width, initial-scale=1.0" />
+		<meta http-equiv="X-UA-Compatible" content="ie=edge" />
+		<title>JavaScript 数据结构与算法之美 - 单链表</title>
+	</head>
+	<body></body>
+	<script>
+		// 单链表
+		function SinglyLinkedList() {
+			// 节点
+			function Node(element) {
+				this.element = element; // 当前节点的元素
+				this.next = null; // 下一个节点指针
+			}
+
+			var length = 0; // 链表的长度
+			var head = null; // 链表的头部节点
+
+			// 向链表尾部添加一个新的节点
+			this.append = function(element) {
+				var node = new Node(element);
+				var currentNode = head;
+
+				// 判断是否为空链表
+				if (head === null) {
+					// 是空链表，就把当前节点作为头部节点
+					head = node;
+				} else {
+					// 从 head 开始一直找到最后一个 node
+					while (currentNode.next) {
+						// 后面还有 node
+						currentNode = currentNode.next;
+					}
+					// 把当前节点的 next 指针 指向 新的节点
+					currentNode.next = node;
+				}
+				// 链表的长度加 1
+				length++;
+			};
+
+			// 向链表特定位置插入一个新节点
+			this.insert = function(position, element) {
+				if (position < 0 && position > length) {
+					// 越界
+					return false;
+				} else {
+					var node = new Node(element);
+					var index = 0;
+					var currentNode = head;
+					var previousNode;
+
+					// 在最前插入节点
+					if (position === 0) {
+						node.next = currentNode;
+						head = node;
+					} else {
+						// 循环找到位置
+						while (index < position) {
+							index++;
+							previousNode = currentNode;
+							currentNode = currentNode.next;
+						}
+						// 把前一个节点的指针指向新节点，新节点的指针指向当前节点，保持连接性
+						previousNode.next = node;
+						node.next = currentNode;
+					}
+
+					length++;
+
+					return true;
+				}
+			};
+
+			// 从链表的特定位置移除一项
+			this.removeAt = function(position) {
+				if ((position < 0 && position >= length) || length === 0) {
+					// 越界
+					return false;
+				} else {
+					var currentNode = head;
+					var index = 0;
+					var previousNode;
+
+					if (position === 0) {
+						head = currentNode.next;
+					} else {
+						// 循环找到位置
+						while (index < position) {
+							index++;
+							previousNode = currentNode;
+							currentNode = currentNode.next;
+						}
+						// 把当前节点的 next 指针 指向 当前节点的 next 指针，即是 删除了当前节点
+						previousNode.next = currentNode.next;
+					}
+
+					length--;
+
+					return true;
+				}
+			};
+
+			// 从链表中移除指定项
+			this.remove = function(element) {
+				var index = this.indexOf(element);
+				return this.removeAt(index);
+			};
+
+			// 返回元素在链表的索引，如果链表中没有该元素则返回 -1
+			this.indexOf = function(element) {
+				var currentNode = head;
+				var index = 0;
+
+				while (currentNode) {
+					if (currentNode.element === element) {
+						return index;
+					}
+
+					index++;
+					currentNode = currentNode.next;
+				}
+
+				return -1;
+			};
+
+			// 如果链表中不包含任何元素，返回 true，如果链表长度大于 0，返回 false
+			this.isEmpty = function() {
+				return length === 0;
+			};
+
+			// 返回链表包含的元素个数，与数组的 length 属性类似
+			this.size = function() {
+				return length;
+			};
+
+			// 获取链表头部元素
+			this.getHead = function() {
+				return head.element;
+			};
+
+			// 由于链表使用了 Node 类，就需要重写继承自 JavaScript 对象默认的 toString() 方法，让其只输出元素的值
+			this.toString = function() {
+				var currentNode = head;
+				var string = '';
+
+				while (currentNode) {
+					string += ',' + currentNode.element;
+					currentNode = currentNode.next;
+				}
+
+				return string.slice(1);
+			};
+
+			// 打印链表数据
+			this.print = function() {
+				console.log(this.toString());
+			};
+
+			// 获取整个链表
+			this.list = function() {
+				console.log('head: ', head);
+				return head;
+			};
+		}
+
+		// 创建单向链表实例
+		var singlyLinked = new SinglyLinkedList();
+		console.log(singlyLinked.removeAt(0)); // false
+		console.log(singlyLinked.isEmpty()); // true
+		singlyLinked.append('Tom');
+		singlyLinked.append('Peter');
+		singlyLinked.append('Paul');
+		singlyLinked.print(); // "Tom,Peter,Paul"
+		singlyLinked.insert(0, 'Susan');
+		singlyLinked.print(); // "Susan,Tom,Peter,Paul"
+		singlyLinked.insert(1, 'Jack');
+		singlyLinked.print(); // "Susan,Jack,Tom,Peter,Paul"
+		console.log(singlyLinked.getHead()); // "Susan"
+		console.log(singlyLinked.isEmpty()); // false
+		console.log(singlyLinked.indexOf('Peter')); // 3
+		console.log(singlyLinked.indexOf('Cris')); // -1
+		singlyLinked.remove('Tom');
+		singlyLinked.removeAt(2);
+		singlyLinked.print(); // "Susan,Jack,Paul"
+		singlyLinked.list(); // 假数据，具体控制台， Node {element: "Susan", next: Node}
+	</script>
+</html>