leetcode141

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution
    {
        public bool HasCycle(ListNode head)
        {
            //if (head == null)
            //{
            //    return false;
            //}
            //else
            //{
            //    var temp = head;
            //    while (head.next != null)
            //    {
            //        var cur = head.next;
            //        if (temp == cur)
            //        {
            //            return true;
            //        }
            //        else
            //        {
            //            head = head.next;
            //        }
            //    }
            //    return false;
            //}

            if (head == null) return false;
            ListNode walker = head;
            ListNode runner = head;
            while (runner.next != null && runner.next.next != null)
            {
                walker = walker.next;
                runner = runner.next.next;
                if (walker == runner) return true;
            }
            return false;
        }
    }