LeetCode-Remove Nth Node From End of List

最新推荐文章于 2025-07-22 16:33:03 发布
原创 最新推荐文章于 2025-07-22 16:33:03 发布 · 248 阅读 · 0 ·
本内容遵循CC 4.0 BY-SA版权协议
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
标签
#LeetCode
本文介绍了一种高效算法，用于从链表中删除倒数第N个节点，仅通过一次遍历实现。以示例1->2->3->4->5, n=2为例，删除后链表变为1->2->3->5。

题目：

Given a linked list, remove the nth node from the end of list and return its head.

For example,

   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the linked list becomes 1->2->3->5.

Note:
Given n will always be valid.
Try to do this in one pass.

代码如下：



另解：两个相隔n个节点的指针同时移动，当前面的指针移到最后时，后面的指针跳过下一个节点（被删除的节点）；


Remove Nth Node From End of List--LeetCode
涛爸的博客
09-24 257
1.题目Remove Nth Node From End of List Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removi
LeetCode 第 19 题 (Remove Nth Node From End of List)
Ivan 的专栏
07-07 2300
LeetCode 第 19 题 (Remove Nth Node From End of List) Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2.
Leetcode1-100: 19. Remove Nth Node From End of List
Y123iwantit的博客
05-19 170
Leetcode1-100: 19. Remove Nth Node From End of List问题描述解题思路代码实现复杂度分析分析 问题描述 Given a linked list, remove the n-th node from the end of list and return its head. Example: Given linked list: 1->2->3->4->5, and n = 2. After removing the second node
【力扣Leetcode题解系列之0019—Remove Nth Node From End of List 删除链表的倒数第 N 个结点】
最新发布
youngerwang的博客
07-22 1419
本文介绍了删除链表倒数第N个节点的常见解法——双指针法，并提供了Python、Java、C、C++和Go五种语言的实现代码。该算法通过引入哑节点和快慢指针，在O(L)时间复杂度和O(1)空间复杂度内解决问题，其中L为链表长度。关键点在于哑节点的使用确保删除操作的一致性，以及指针同步移动的准确性。文章还分析了算法复杂性和实现难点，并提出了两个扩展题目：删除倒数第k到m个节点和删除特定值的倒数第n个节点，为读者提供了进一步的思考方向。
Leetcode 19. Remove Nth Node From End of List
weixin_33762321的博客
05-04 81
https://leetcode.com/problems/remove-nth-node-from-end-of-list/ /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), n...
LeetCode-Path Sum III
单车人的博客
11-23 462
You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need to start or end at the root or a leaf, but it
LeetCode-First Unique Character in a String
单车人的博客
09-13 387
题目： Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2.
LeetCode-Rotate Function
单车人的博客
10-16 385
Given an array of integers A and let n to be its length. Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a "rotation function" F on A as follow:
LeetCode-Spiral Matrix
单车人的博客
10-13 383
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example, Given the following matrix: [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ]
LeetCode-Reverse Words in a String
单车人的博客
09-20 371
题目： Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". Update (2015-02-12): For C programmers: Try to solve it in
LeetCode-ZigZag Conversion
单车人的博客
09-01 362
原题陈述： The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A
LeetCode-Path Sum II
单车人的博客
11-23 362
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree and sum = 22, 5 / \
LeetCode-Minimum Depth of Binary Tree
单车人的博客
11-28 336
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. 解题思路在代码注释中说明。 代码如下： /** * D
LeetCode-Integer to Roman
单车人的博客
10-21 331
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 罗马数字组成单元： I: 1 IV: 4 V: 5 IX: 9 X: 10 XL: 40 L: 50 XC: 90 C: 10
LeetCode-Maximum Subarray
单车人的博客
10-13 329
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] ha
LeetCode-House Robber
单车人的博客
09-21 328
题目： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjac
LeetCode-Remove Elements
单车人的博客
10-17 323
Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory.
LeetCode-Symmetric Tree
单车人的博客
11-25 318
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3
LeetCode-Binary Tree Level Order Traversal
单车人的博客
11-25 313
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20
LeetCode-Reverse Integer
单车人的博客
09-04 310
题目： Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here are some good questions to ask
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值