mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-09 15:59:06 +01:00
java: add «141. Linked List Cycle»
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
parent
b9f735f1e8
commit
2d4ba86cbe
1 changed files with 21 additions and 0 deletions
21
java/linked-list-cycle.java
Normal file
21
java/linked-list-cycle.java
Normal file
|
@ -0,0 +1,21 @@
|
||||||
|
/**
|
||||||
|
* 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) {
|
||||||
|
var x = head;
|
||||||
|
var y = head;
|
||||||
|
|
||||||
|
while (y != null && y.next != null) {
|
||||||
|
x = x.next;
|
||||||
|
y = y.next.next;
|
||||||
|
|
||||||
|
if (x == y) {
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
Loading…
Reference in a new issue