关于有环链表的若干问题总结

最新推荐文章于 2024-08-01 00:32:18 发布

jbcsimpleLearn

最新推荐文章于 2024-08-01 00:32:18 发布

阅读量402

点赞数

分类专栏：算法与数据结构、编程文章标签：算法与数据结构

本文链接：https://blog.csdn.net/jbctcx/article/details/52230347

版权

算法与数据结构、编程专栏收录该内容

8 篇文章 0 订阅

订阅专栏

1、判断一个链表是否有环

public boolean hasCircle(ListNode pHead) {
    if(pHead == null)
        return false;
    
    ListNode fast = pHead, slow = pHead;
    
    while(fast != null) {
        if(fast.next != null)
            fast = fast.next.next;
        else
            fast = fast.next;
            
        slow = slow.next;
        
        if(fast == slow)
            return true;
    }
    
    if(fast == null)
        return false;
}

2、求一个有环链表的长度

3、求一个有环链表的环的首结点

4、求一个链表的长度

public int lenOfCircle(ListNode pHead) {
    if(pHead == null)
        return 0;
    
    ListNode fast = pHead, slow = pHead;
    
    while(fast != null) {
        if(fast.next != null)
            fast = fast.next.next;
        else
            fast = fast.next;
            
        slow = slow.next;
        
        if(fast == slow)
            break;
    }
    
    if(fast == null)
        return 0;
        
    int len = 1;
    slow = slow.next;
    while(slow != fast) {
        slow = slow.next;
        len++;
    }
    
    return len;
}/*
 public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}
*/
public class Solution {

    public ListNode EntryNodeOfLoop(ListNode pHead)
    {
    	if(pHead == null)
    		return null;
    	
    	ListNode pNode, fast = pHead, slow = pHead;
    	
    	while(fast != null && fast.next != null) {
    		fast = fast.next.next;
    		slow = slow.next;
    		
    		if(fast == slow)
    			break;
    	}
    	
    	if(fast == null || fast.next == null)
    		return null;
    	
    	slow = pHead;
    	while(slow != fast) {
    		fast = fast.next.next;
    		slow = slow.next;
    	}
    	
    	return slow;
    }
}