/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode getKthFromEnd(ListNode head, int k) {
ListNode p = head;
ListNode q = head;
while (k > 1) {
p = p.next;
k--;
}
while (p.next != null) {
p = p.next;
q = q.next;
}
return q;
}
}
剑指offer-2.26-22
最新推荐文章于 2022-02-14 10:35:37 发布