|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/working-with-linkedlist/
课程评论：没有评论
Coursera 课程《Java 链表操作》课程总结 **课程概述：** 本课程旨在介绍链表（LinkedList）这一数据结构，并说明它是所有数据结构（DSA）主题中最易于掌握的部分。课程将详细解释链表的概念、组成原理、实际应用场景以及不同类型的链表。 **何为链表？** 链表是一种由节点（Node）组成的线性数据结构。每个节点包含两个核心元素： * **数据（Data）：** 存储实际的值。 * **地址/指针（Address/Pointer）：** 存储指向下一个节点的内存地址。 当多个节点通过地址相互连接起来，便形成了一个链表。 **为何使用链表？** 与数组相比，链表在以下情况具有优势： * **大小不确定性：** 当无法预知需要存储元素的数量时，数组由于其固定的大小限制而难以适用。链表则可以动态地增长或缩小，更灵活地应对未知大小的数据集。 **链表类型：** 课程将深入讲解以下几种常见的链表类型： * **单向链表 (Singly Linked List)：** 节点只能沿一个方向（向前）遍历。每个节点的“下一个”指针指向后一个节点，而最后一个节点的“下一个”指针通常指向 null。 * **双向链表 (Doubly Linked List)：** 节点可以沿两个方向（向前和向后）遍历。每个节点不仅有指向下一个节点的指针，还有一个指向前一个节点的指针。 * **循环链表 (Circular Linked List)：** 最后一个节点的“下一个”指针会指向链表的第一个节点（头节点），形成一个环。 * **双向循环链表 (Doubly Circular Linked List)：** 结合了双向链表和循环链表的特性。每个节点既有指向下一个节点的指针，也有指向前一个节点的指针，且最后一个节点的“下一个”指针指向第一个节点，第一个节点的“上一个”指针指向最后一个节点。 **常见方法：** 在解决链表问题时，**“双指针法”（Two Pointer Approach）** 是最常用的技术。 **课程实践：** 本课程也通过解决实际的 LeetCode 问题，帮助学员巩固链表操作的知识和技巧。
LinkedList is the easiest topic comparing with all other DSA topics.What is LinkedList?A class / node is created with two elements - data and address. Data field stores some values. Address field will store the address of the node to which it needs to connect.When several nodes are connected with each other, it forms a Linked List.Why Linked List?Array has a size limitation. When we don't know the size of the elements we are going to have, we can't use Arrays. We can use Lists in those situationsTypes of Linked Lists:Simple Linked List - In this type of linked list, one can move or traverse the linked list in only one direction. where the next pointer of each node points to other nodes but the next pointer of the last node points to NULL. It is also called "Singly Linked List".Doubly Linked List - In this type of linked list, one can move or traverse the linked list in both directions (Forward and Backward)Circular Linked List - In this type of linked list, the last node of the linked list contains the link of the first/head node of the linked list in its next pointer.Doubly Circular Linked List - A Doubly Circular linked list or a circular two-way linked list is a more complex type of linked list that contains a pointer to the next as well as the previous node in the sequence. The difference between the doubly linked and circular doubly list is the same as that between a singly linked list and a circular linked list. The circular doubly linked list does not contain null in the previous field of the first node.Two pointer approach is the most commonly used approached for all Linked list problems. In this course, we have solved many basic Leetcode questions related to Linked list.
