Linked List Cycle

最新推荐文章于 2022-12-06 22:57:02 发布

benbenab

最新推荐文章于 2022-12-06 22:57:02 发布

阅读量560

点赞数

分类专栏： Tree

本文链接：https://blog.csdn.net/benbenab/article/details/39669567

版权

Tree 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Given a linked list, determine if it has a cycle in it.

Follow up:

Can you solve it without using extra space?

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool hasCycle(ListNode *head) {
        ListNode* step1 = head;
        ListNode* step2 = head;
        while(step2 != NULL && step1->next != NULL && step2 -> next != NULL )
        {
            step1 = step1->next;
            step2 = step2->next->next;
            if (step1 == step2)
                return true;
        }
        return false;
    }
};

最开始总有 run time error，是因为缺少了