Java 剑指 Offer 22. 链表中倒数第k个节点

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode getKthFromEnd(ListNode head, int k) {
        ListNode node1=head;
        ListNode node2=head;
        for (int i = 0; i < k; i++) {
            node1=node1.next;
        }
        while (node1!=null){
            node1=node1.next;
            node2=node2.next;
        }
        return node2;
    }
}