【LeetCode】141.Linked List Cycle(easy)解题报告
tags: Two Pointers Linked List
题目地址:https://leetcode.com/problems/linked-list-cycle/description/
题目描述:
Given a linked list, determine if it has a cycle in it.
Can you solve it without using extra space?
Solution1:快慢两个指针,时间复杂度O(n),空间复杂度O(1)
/**
* 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) {
if(head == null){
return false;
}
ListNode fast = head;
ListNode slow = head;
while(fast.next!=null){
fast = fast.next;
if(fast.next==null){
return false;
}
fast = fast.next;
slow = slow.next;
if(fast==slow){
return true;
}
}
return false;
}
}
简洁写法:
public boolean hasCycle(ListNode head) {
if (head == null || head.next == null) {
return false;
}
ListNode slow = head;
ListNode fast = head.next;
while (slow != fast) {
if (fast == null || fast.next == null) {
return false;
}
slow = slow.next;
fast = fast.next.next;
}
return true;
}
Solution2:逐个节点找,然后标记,检测。时间,空间复杂度都是O(n).
public boolean hasCycle(ListNode head) {
Set<ListNode> nodesSeen = new HashSet<>();
while (head != null) {
if (nodesSeen.contains(head)) {
return true;
} else {
nodesSeen.add(head);
}
head = head.next;
}
return false;
}
Date:2017年10月22日