链表指针操作模式

两数相加

Add Two Numbers requires careful linked-list pointer manipulation to sum digits while handling carries efficiently in in…

删除链表的倒数第 N 个结点

Remove the nth node from the end of a linked list using a two-pointer approach to solve efficiently.

合并两个有序链表

Merge two sorted linked lists by splicing nodes into one sorted list using linked-list pointer manipulation and recursio…

合并 K 个升序链表

Merge k Sorted Lists requires efficiently combining multiple sorted linked lists into one using pointers and priority qu…

两两交换链表中的节点

Learn how to swap every adjacent linked-list pair by rewiring nodes safely without changing values or breaking the remai…

K 个一组翻转链表

Reverse Nodes in k-Group challenges you to reverse segments of a linked list in groups of size k.

旋转链表

Rotate a singly linked list to the right by k positions using careful pointer manipulation and two-pointer traversal tec…

删除排序链表中的重复元素 II

Remove duplicates from a sorted linked list, leaving only distinct values, and return the modified list in sorted order.

删除排序链表中的重复元素

Efficiently remove duplicates from a sorted linked list using precise pointer manipulation while maintaining node order …

分隔链表

Partition a linked list such that all nodes less than x come before nodes greater than or equal to x while preserving re…

反转链表 II

Reverse a segment of a singly linked list from position left to right using precise pointer manipulation techniques.

有序链表转换二叉搜索树

Convert a sorted singly linked list into a height-balanced BST using pointer manipulation and divide-and-conquer recursi…

二叉树展开为链表

Flatten a binary tree into a right-skewed linked list by manipulating pointers following a pre-order traversal, handling…

填充每个节点的下一个右侧节点指针

Connect each node across every level by reusing established next links to traverse a perfect binary tree without extra q…

填充每个节点的下一个右侧节点指针 II

Populate each next pointer in a binary tree to its immediate right node, handling nulls and uneven levels efficiently us…

随机链表的复制

This problem requires copying a linked list where each node has a random pointer in addition to the next pointer.

环形链表

Determine if a given linked list contains a cycle using pointer manipulation or hashing, focusing on detecting repeated …

环形链表 II

Identify the start of a cycle in a linked list using pointer manipulation, efficiently handling edge cases without modif…

重排链表

Reorder List requires careful pointer manipulation in a singly linked list to interleave nodes from the ends without alt…

LRU 缓存

Implement an efficient LRU Cache using hash table and doubly-linked list to achieve O(1) operations for get and put.

对链表进行插入排序

Sort a singly linked list using insertion sort by carefully manipulating pointers to maintain a sorted order efficiently…

排序链表

Sort List requires sorting a singly linked list efficiently using pointer manipulation and merge sort for optimal perfor…

相交链表

Given two linked lists, find the node where they intersect or return null if they do not.

移除链表元素

Remove all nodes from a linked list that have a specific value, adjusting pointers to preserve the rest of the list.