【数据结构】【链表代码】 链表的中间节点

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* middleNode(struct ListNode* head) {
    struct ListNode*slow=head;
    struct ListNode*fast=head;
    while(fast/*偶判断*/&&fast->next/*奇判断*/){
        slow=slow->next;
        fast=fast->next->next;
    }

    return slow;
}