单链表倒数第K个节点的查找和显示

class Node{
    int value;
    Node next;
    public Node(int value){
        this.value=value;
    }
}
public class Danlianbiao {
    public static void main(String[] args) {
        Node node=new Node(1);
        Node node2=node.next=new Node(2);
        Node node3=node2.next=new Node(3);
        Node node4=node3.next=new Node(4);
        Node node5=node4.next=new Node(5);
        Node node6=node5.next=new Node(6);
        Node node7=node6.next=new Node(7);
        Node node8=node7.next=new Node(8);
        System.out.println(getLast(node, 9));
    }
    public static int getLast(Node node,int n){
        LinkedList<Integer> ll=new LinkedList<>();
        Node temp=node;
        while(true){
            if(temp.next==null){
                break;
            }else{
                ll.add(temp.value);
                if(ll.size()>n){
                    ll.removeFirst();
                }
                temp=temp.next;
            }
        }
        return ll.size()==0?temp.value:ll.get(0);
    }
}

    public static int getLast1(Node node,int n){
        Node temp=node;
        Node p=node;
        int  count=0;
        while(true){
            if(temp.next==null){
                break;
            }else{
                temp=temp.next;
                count++;
                if(count>=n){
                    p=p.next;
                }
            }
        }
        return p.value;
    }