剑指Offer_14_链表中倒数第k个结点

题目描述

解题思路

null

实现

/*链表结点的定义*/
public class ListNode {
int val;
ListNode next = null;

ListNode(int val) {
this.val = val;
}
}
/*实现*/
public class Solution {
public ListNode FindKthToTail(ListNode head,int k) {
if (k <= 0 || head == null) return null;
ListNode p1 = head, p2 = head;
int c = 0;
while (p1 != null && c < k){
p1 = p1.next;
c++;
}
if (c < k) return null;
while (p1 != null){
p1 = p1.next;
p2 = p2.next;
}
return p2;
}
}