package common;
/**
* @author : zhaoliang
* @program :newCoder
* @description : 链表中倒数第k个结点
* @create : 2020/11/21 10:30
*/
public class FindKthToTail {
//输入一个链表,输出该链表中倒数第k个结点
public static class ListNode{
int val;
ListNode next;
ListNode(int x){
val = x;
}
}
public static ListNode findKthToTail(ListNode head,int k){
if (head==null || k <0)return null;
ListNode p=head,q = head;
int count =0;
int index = k;
while (p!=null){
p = p.next;
count++;
if (k <1){
q = q.next;
}
k--;
}
if (count < index){
return null;
}
return q;
}
}
常见算法-链表中倒数第k个节点
最新推荐文章于 2024-07-19 19:11:19 发布