题目描述
输入一个链表,输出该链表中倒数第k个结点。
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode FindKthToTail(ListNode head,int k) {
ListNode node = head;
ListNode node1 = head;
int totalCount = 0;
while(node != null){
node = node.next;
totalCount++;
}
if(totalCount < k){
return null;
}
for(int i = 0; i < totalCount - k; i++){
node1 = node1.next;
}
return node1;
}
}