0
点赞
收藏
分享

微信扫一扫

LeetCode刷题笔记- 143.翻转链表

彩虹_bd07 2022-03-19 阅读 58

LeetCode刷题笔记- 141.环形链表

不同速率同赛道相遇方案

C代码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
bool hasCycle(struct ListNode *head) {
    struct ListNode *tf = NULL; 
    struct ListNode *ts = NULL;

    if (head == NULL)
        return false;
    tf = head;
    ts = head->next;

    while (1) {
        if (tf == NULL)
            break;
        if (ts == NULL)
            break;
        if (tf == ts)
            return true;
        tf = tf->next;
        ts = ts->next;
        if (ts == NULL)
            break;
        ts = ts->next;
    }
    return false;
}

注意点

  1. 快者与慢者的起跑点初始化需要不同更方便实现;
举报

相关推荐

0 条评论