CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-02-10 22:25:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Replace 结点 with 节点 (#452)

Browse Source 
* Replace 结点 with 节点
Update the footnotes in the figures

* Update mindmap

* Reduce the size of the mindmap.png
This commit is contained in:
Yudong Jin
2023-04-09 04:32:17 +08:00
committed by GitHub
parent 3f4e32b2b0
commit 1c8b7ef559
395 changed files with 2056 additions and 2056 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
codes/java/chapter_array_and_linkedlist/linked_list.java
View File

@@ -9,14 +9,14 @@ package chapter_array_and_linkedlist;
import include.*;
public class linked_list {
/* 在链表的结点 n0 之后插入结点 P */
/* 在链表的节点 n0 之后插入节点 P */
static void insert(ListNode n0, ListNode P) {
ListNode n1 = n0.next;
P.next = n1;
n0.next = P;
}
/* 删除链表的结点 n0 之后的首个结点 */
/* 删除链表的节点 n0 之后的首个节点 */
static void remove(ListNode n0) {
if (n0.next == null)
return;
@@ -26,7 +26,7 @@ public class linked_list {
n0.next = n1;
}
/* 访问链表中索引为 index 的结点 */
/* 访问链表中索引为 index 的节点 */
static ListNode access(ListNode head, int index) {
for (int i = 0; i < index; i++) {
if (head == null)
@@ -36,7 +36,7 @@ public class linked_list {
return head;
}
/* 在链表中查找值为 target 的首个结点 */
/* 在链表中查找值为 target 的首个节点 */
static int find(ListNode head, int target) {
int index = 0;
while (head != null) {
@@ -51,7 +51,7 @@ public class linked_list {
/* Driver Code */
public static void main(String[] args) {
/* 初始化链表 */
// 初始化各个结点
// 初始化各个节点
ListNode n0 = new ListNode(1);
ListNode n1 = new ListNode(3);
ListNode n2 = new ListNode(2);
@@ -65,22 +65,22 @@ public class linked_list {
System.out.println("初始化的链表为");
PrintUtil.printLinkedList(n0);
/* 插入结点 */
/* 插入节点 */
insert(n0, new ListNode(0));
System.out.println("插入结点后的链表为");
System.out.println("插入节点后的链表为");
PrintUtil.printLinkedList(n0);
/* 删除结点 */
/* 删除节点 */
remove(n0);
System.out.println("删除结点后的链表为");
System.out.println("删除节点后的链表为");
PrintUtil.printLinkedList(n0);
/* 访问结点 */
/* 访问节点 */
ListNode node = access(n0, 3);
System.out.println("链表中索引 3 处的结点的值 = " + node.val);
System.out.println("链表中索引 3 处的节点的值 = " + node.val);
/* 查找结点 */
/* 查找节点 */
int index = find(n0, 2);
System.out.println("链表中值为 2 的结点的索引 = " + index);
System.out.println("链表中值为 2 的节点的索引 = " + index);
}
}