Leetcode 141. Linked List Cycle

最快解题思路: brutal force.

class Solution {
public:
    bool hasCycle(ListNode *head) {
        //https://www.bilibili.com/video/BV1mr4y1s747/?spm_id_from=333.337.search-card.all.click&vd_source=8907db080287c3791c4b3669d801d840
        //特殊值
        int count = 10001;//题目规定不能大于10000
        while(count){
            if(head == nullptr)  return false;
            head = head->next;
            count --;
        }
        return true;
    }
};

其他解法: 快慢指针，基础入手 推荐视频