【LeetCode】 141. Linked List Cycle

来源:互联网 发布:安禄山 杨贵妃 知乎 编辑:程序博客网 时间:2024/06/05 11:44

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 runner = head;        ListNode walker = head;        while (runner.next != null && runner.next.next != null) {            runner = runner.next.next;            walker = walker.next;            if (walker == runner) {                return true;            }        }        return false;    }}


0 0
原创粉丝点击