java 搜索起始位置,JAVA实现 查找有环链表起始位置

public class FindCircleBeginning {

class ListNode {

public int id;

public ListNode next;

public ListNode() {

}

public ListNode(int id, ListNode next) {

this.id = id;

this.next = next;

}

}

public ListNode createList(int n) {

ListNode head = new ListNode(0,null);

ListNode p = head;

for (int i = 1; i <= n; ++i) {

ListNode tmp = new ListNode(i,null);

p.next = tmp;

p = tmp;

}

return head;

}

/**

* @param n 链表总长度

* @param m 环所在的位置,head为0,不计算入内,所以长度为n的链表位置分别为1-n

* @return

*/

public ListNode createList(int n, int m) {

if (m >= n || m <= 0) {

System.out.println("Cannot creat a linkedlist with a circle!");

return null;

}

ListNode head = new ListNode(0,null);

ListNode p = head;

for (int i = 1; i <= n; ++i) {

ListNode tmp = new ListNode(i,null);

p.next = tmp;

p = tmp;

}

ListNode q = head;

for (int i = 1; i <= m; ++i) {

q = q.next;

}

p.next = q;//加环

return head;

}

/**

* @param head 链表的头指针

* 为防止有环存在的链表无线循环下去,设定了limit长度为展示总长度

*/

public void displayList(ListNode head) {

int limit = 100;

int i = 0;

while (head.next != null && ++i <= limit) {

System.out.print(head.id + "->");

head = head.next;

}

if (i > limit) {

System.out.println();

System.out.println("Maybe there exists a circle in the linkedlist.");

} else {

System.out.println("null");

}

}

public ListNode findCircle(ListNode head) {

if (head == null) {

return null;

}

ListNode fast = head.next;

ListNode slow = head.next;

boolean hasCircle = false;

while (true) {

if (fast.next != null && slow.next != null && fast.next.next != null) {

fast = fast.next.next;

slow = slow.next;

} else {

break;

}

if (slow == fast) {

hasCircle = true;

break;

}

}

if (hasCircle) {

slow = head.next;

while (slow != fast) {

slow = slow.next;

fast = fast.next;

}

return slow;

} else {

System.out.println("NO circle.");

return null;

}

}

public static void main(String[] args) {

FindCircleBeginning fcb = new FindCircleBeginning();

ListNode ln = fcb.createList(7,5);

fcb.displayList(ln);

ListNode circlebeginNode = fcb.findCircle(ln);

if (circlebeginNode != null) {

System.out.println("Circle begins at " + circlebeginNode.id);

}

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值