看题:
代码:
struct ListNode* middleNode(struct ListNode* head){
struct ListNode* fast=head;
struct ListNode* slow=head;
while(fast&&fast->next)
{
slow=slow->next;//慢指针一次走一步
fast=fast->next->next;//快指针一次走两步
}
return slow;
}