0
点赞
收藏
分享

微信扫一扫

Laravel自定义辅助函数:提升开发效率的秘诀

雷亚荣 2024-08-02 阅读 16

链表的中间结点

点击链接做题

思路代码:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
typedef struct ListNode ListNode;
struct ListNode* middleNode(struct ListNode* head) {
    ListNode* slow = head, *fast = head;
    //慢指针每次走1步,快指针每次走2步
    while(fast && fast->next){//不能写while(fast->next && fast)
        slow = slow->next;
        fast = fast->next->next;
    }
    //此时slow指向的结点刚好就是中间结点
    return slow;
}
举报

相关推荐

0 条评论