public ListNode FindKthToTail(ListNode head,int k) {
int num = 0;
ListNode node = head;
while(node != null){
node = node.next;
++num;
}
if(k > num || k == 0) return null;
ListNode p1 = head;
ListNode p2 = head;
while(--k > 0){
p1 = p1.next;
}
while(p1.next != null){
p1 = p1.next;
p2 = p2.next;
}
return p2;
}
22 链表中倒数第k个节点
最新推荐文章于 2023-02-22 19:45:18 发布