/*
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_k=null;
ListNode node=head;
int total=0;
while(head !=null){
//统计链表中一共有多少个节点
total++;
head=head.next;
}
head=node;
if(total - k >=0){
for(int i=1;i<=total-k;i++){
//遍历查找倒数第k个节点
head=head.next;
}
node_k=head;
}
return node_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_k=null;
ListNode node=head;
int total=0;
while(head !=null){
//统计链表中一共有多少个节点
total++;
head=head.next;
}
head=node;
if(total - k >=0){
for(int i=1;i<=total-k;i++){
//遍历查找倒数第k个节点
head=head.next;
}
node_k=head;
}
return node_k;
}
}