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
33 lines (30 loc) · 783 Bytes

File metadata and controls

33 lines (30 loc) · 783 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
30
31
32
33
package leetcode._19_;
import leetcode.common.ListNode;
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode node1 = head;
ListNode node2 = head;
// 由于题目中说到 n 永远有效,所以不做 nodeList 长度不足n的判断
for (int i = 0; i < n; i++) {
node1 = node1.next;
}
if (node1 == null) {
return head.next;
}
node1 = node1.next;
while (node1 != null) {
node1 = node1.next;
node2 = node2.next;
}
node2.next = node2.next.next;
return head;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.