Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
給定一個(gè)鏈表霜幼，檢測(cè)內(nèi)部是否有cycle
算法分析
方法一
通過(guò)哈希表來(lái)解決問(wèn)題
Java代碼
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public boolean hasCycle(ListNode head) {
Set<ListNode> listSet = new HashSet<>();
while(head != null) {
if (listSet.contains(head))
return true;
else
listSet.add(head);
head = head.next;
}
return false;
}
}
