链表中倒数第K个结点（getKthFromEnd） Leetcode 09

class Solution {

    public ListNode getKthFromEnd(ListNode head, int k) {

        ListNode fast = head;

        ListNode slow = head;

        while (fast != null && k > 0) {

            fast = fast.next;

            k--;

        }

        while (fast != null) {

            fast = fast.next;

            slow = slow.next;

        }

        return slow;

    }

}

原创禁止转载！！！