Leetcode 876. 链表的中间结点 c

c语言版

struct ListNode* middleNode(struct ListNode* head){
    
    struct ListNode* p = head;
    int len = 0;
    while(p ->next){
        len++;
        p = p->next;
    }
    int mid = (len >> 1) + len % 2;
    
    struct ListNode* p1 = head;
    int len1 = 0;
    while(p1->next){
        if(len1 == mid){
            break;
        }
        p1 = p1->next;
        len1++;
    }
    return p1;
}