Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
/**
* 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 n1 = head;
ListNode n2 = head;
while(true) {
n1 = n1.next;
if(n1==null) {
return false;
}
n2 = n2.next;
if(n2==null) {
return false;
}
n2 = n2.next;
if(n2==null) {
return false;
}
if(n1==n2) {
return true;
}
}
}
}
没有评论:
发表评论