题目描述:Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
1自己的代码
2别人的代码
该问题是经典面试问题,其标准解法是用两个指针,一快一慢,如果在快的指针能够追上慢的指针,则有环,否则无环。
Follow up:
Can you solve it without using extra space?
1自己的代码
class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
next = null;
}
}
public class LinkedListCycle {
public boolean hasCycle(ListNode head) {
boolean returns = false;
while(head != null){
if(head.val == 65535) {returns = true; break;}
head.val = 65535;//取了一个比较大的数
head = head.next;
}
return returns;
}
}
2别人的代码
该问题是经典面试问题,其标准解法是用两个指针,一快一慢,如果在快的指针能够追上慢的指针,则有环,否则无环。
class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
next = null;
}
}
public class LinkedListCycle {
public boolean hasCycle(ListNode head) {
if(head == null || head.next == null) return false;
ListNode fast = head;
ListNode slow = head;
while(true){
if(fast.next == null) return false;
fast = fast.next;
if(fast.next == null) return false;
fast = fast.next;
slow = slow.next;
if(fast == slow) return true;
}
}
}