/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int kthToLast(ListNode head, int k) {
ListNode runner = head;
ListNode walker = head;
for (int i = 0; i < k; i++) {
runner = runner.next;
}
while(runner != null){
runner = runner.next;
walker = walker.next;
}
return walker.val;
}
}
05-21
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交