找出链表中倒数第K个结点

public static ListNode findCountDownNode(ListNode head,int k){
        if(head == null || k <= 0){
            return null;
        }
        ListNode fast = head;   
        for(int i = 0;i < k-1; i++){
            if(fast.next != null) {
                fast = fast.next;
            } else {
                return null;
            }
        }
        ListNode slow = head;
        while(fast.next != null){
            fast = fast.next;
            slow = slow.next;
        }
        return slow;
    }