链表中的倒数第k个结点

package java_study.JianZhiOffer;

/**
 * Created by ethan on 2015/6/24.
 * 剑指offer N016链表中的倒数第k个结点
 * 关键注意： k的为0或者负数，
 */
public class No15倒数第k个结点 {

    public Node findLastK(Node head, int k){
        if (head==null) return null;
        if (k<=0) return null;
        Node p = head;
        Node q = head;
        for (int i=1; i<k; i++){
            p = p.getNext();
            if (p==null)
                return null;
        }
        while (p.getNext()==null){
            p = p.getNext();
            q = q.getNext();
        }
        return q;
    }
}