CODE 138: Linked List Cycle

Given a linked list, determine if it has a cycle in it.

Follow up:
Can you solve it without using extra space?

   public boolean hasCycle(ListNode head) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(null == head){
            return false;
        }
    	ListNode first = head;
    	ListNode second = head;
    	while(first.next != null && first.next.next !=null){
    		if(first.next.equals(second) || first.next.next.equals(second)){
    			return true;
    		}
    		first = first.next.next;
    		second = second.next;
    	}
    	if(first.next != null && first.next.equals(second)){
    		return true;
    	}
    	return false;
    }


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值