876. 链表的中间结点 - 力扣（LeetCode）( 点击前面链接即可查看题目)

/*** 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;//空指针if(NULL == head){return NULL;}//一个结点else if(NULL == head->next){return head;}//大于等于2个结点else {while(fast){if(NULL == fast->next){return slow;}slow = slow->next;fast = fast->next->next;}return slow;}
}