Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
29 lines (27 loc) · 640 Bytes

File metadata and controls

29 lines (27 loc) · 640 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
//
// Solution19.cpp
// Algorithm
//
// Created by Pancf on 2020/10/11.
// Copyright © 2020 Pancf. All rights reserved.
//
#include "Solution19.hpp"
// 一次遍历移除从链表末尾开始计数的第n个节点
ListNode* Solution19::removeNthFromEnd(ListNode* head, int n)
{
// double pointer is awesome
ListNode** slow = &head;
ListNode* fast = head;
while (n--) {
fast = fast->next;
}
while (fast) {
fast = fast->next;
slow = &((*slow)->next);
}
// entry is the node to be deleted
ListNode* entry = *slow;
*slow = entry->next;
delete entry;
return head;
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.