题解 | #判断链表中是否有环#(无脑暴力解法)

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
#include <cstddef>
class Solution {
public:
    bool hasCycle(ListNode *head) {
        int n = 1;
        while(head!=NULL){
            if(n>100000) return true;
            head = head->next;
            n++;
        }
        return false;
    }
};