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
31 lines (29 loc) · 797 Bytes

File metadata and controls

31 lines (29 loc) · 797 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
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
//双指针法,先让第一个指针走k-1步,到达地k个节点。 然后再让两个指针一起走,等到第一个指针到末尾时,第二个指针恰好到倒数第k个节点
public class Solution {
public ListNode FindKthToTail(ListNode head,int k) {
if(head==null||k<=0) return null;
ListNode fn = head;
ListNode sn = head;
for (int i=1;i<k;i++)
{
if(fn.next!=null)
fn=fn.next;
else
return null;
}
while(fn.next!=null)
{
fn=fn.next;
sn=sn.next;
}
return sn;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.