CCI 2.2 找出单向链表中倒数第k个结点

来源:互联网 发布:prize软件优势 编辑:程序博客网 时间:2024/05/29 11:57

实现一个算法,找出单向链表中倒数第k个结点。

package test;public class KthNode {//快慢指针public Node kthNode(Node head, int k){if(head==null || k<=0)return null;Node slow, fast;slow = fast = head;while(k>0){if(fast==null)return null;fast = fast.next;k--;}while(fast != null){fast = fast.next;slow = slow.next;}return slow;}}


0 0
原创粉丝点击