algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2518 from PHJ369906/beChild-bugfix-branch

Browse Source 
Update: 修复原Java版本报空指针异常(NullPointerException)
This commit is contained in:
程序员Carl
2024-04-09 21:28:01 +08:00
committed by GitHub
parent a8de2463bc 2dce5252c0
commit 0cdf537370
1 changed files with 24 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
problems/0019.删除链表的倒数第N个节点.md
View File

@ -98,15 +98,17 @@ public:
### Java: ### Java:
```java ```java
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) { public ListNode removeNthFromEnd(ListNode head, int n) {
//新建一个虚拟头节点指向head
ListNode dummyNode = new ListNode(0); ListNode dummyNode = new ListNode(0);
dummyNode.next = head; dummyNode.next = head;
//快慢指针指向虚拟头节点
ListNode fastIndex = dummyNode; ListNode fastIndex = dummyNode;
ListNode slowIndex = dummyNode; ListNode slowIndex = dummyNode;
// 只要快慢指针相差 n 个结点即可 // 只要快慢指针相差 n 个结点即可
for (int i = 0; i < n ; i++){ for (int i = 0; i <= n; i++) {
fastIndex = fastIndex.next; fastIndex = fastIndex.next;
} }
@ -117,9 +119,13 @@ public ListNode removeNthFromEnd(ListNode head, int n){
// 此时 slowIndex 的位置就是待删除元素的前一个位置。 // 此时 slowIndex 的位置就是待删除元素的前一个位置。
// 具体情况可自己画一个链表长度为 3 的图来模拟代码来理解 // 具体情况可自己画一个链表长度为 3 的图来模拟代码来理解
// 检查 slowIndex.next 是否为 null，以避免空指针异常
if (slowIndex.next != null) {
slowIndex.next = slowIndex.next.next; slowIndex.next = slowIndex.next.next;
}
return dummyNode.next; return dummyNode.next;
} }
}
``` ```
### Python: ### Python: