链表中倒数第k个结点

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
import java.util.LinkedList;
import java.util.Queue;
public class Solution {
    public ListNode FindKthToTail(ListNode head,int k) {
         Queue<ListNode> queue = new LinkedList<ListNode>();
       while(head!=null){
           queue.offer(head);
           if(queue.size()>k){
               ListNode x=queue.poll();
           }
           head=head.next;
       }
       if(queue.size()<k)//链表长度可能小于k 
           return null;
       head=queue.poll();
       return head;
    }
}

来源：CSDN

作者：become__better

链接：https://blog.csdn.net/xiaoshazheng/article/details/104620471