首页 > 代码库 > [LeetCode]141 Linked List Cycle
[LeetCode]141 Linked List Cycle
https://oj.leetcode.com/problems/linked-list-cycle/
http://blog.csdn.net/linhuanmars/article/details/21200601
/** * 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) { // Use 2 pointers. if (head == null) return false; ListNode one = head; ListNode two = head; while (one != null && two != null) { one = one.next; two = two.next; if (two != null) two = two.next; if (one != null && one == two) return true; } return false; } }
[LeetCode]141 Linked List Cycle
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。