142. 环形链表 II
摘要:
class Solution { public: ListNode *detectCycle(ListNode *head) { ListNode* fast = head; ListNode* slow = head; while(fast && fast->next){ fast = fast- 阅读全文
posted @ 2024-09-30 19:46 神奇的萝卜丝 阅读(10) 评论(0) 推荐(0)
浙公网安备 33010602011771号