输入一个链表，输出该链表中倒数第k个结点

package suanfa;

import suanfa.doubleLinkedList.Node;

public class solution {
    
    
    public Node find(Node head,int k){
        
        int size=0;
        Node current=head;
        while(current !=null){
            
            size+=1;
            current=current.next;
            
        }
        
        for (int i=0;i<size-k;i++){
            
            
            head=head.next;
        }
        return head;
    }

}