链表之链表中倒数第k个节点

public class Solution {
    public ListNode FindKthToTail(ListNode head,int k) {
        if(head == null) return head;
        // 肯定要遍历一次，获取整个链表的长度
        int count = 0;
        ListNode node = head; 
        while(node != null){
            node = node.next;
            count++;
        }
        if(count < k) return null;
        for(int i=0;i<count-k;i++){
            head = head.next;
        }
        return head;
    }
}

来源：CSDN

作者：ok绷了绷

链接：https://blog.csdn.net/wjavadog/article/details/103634199