思路是:快慢指针,如何有环,两个指针进入环一定可以追上。
/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ bool hasCycle(struct ListNode *head) { struct ListNode *slow = head; struct ListNode *fast = head; while(fast && fast->next) { slow = slow->next; fast = fast->next->next; if(fast == slow) { return true; } } return NULL; }
141.环形链表
于 2022-05-11 20:16:29 首次发布