- 思路
这个就是典型的快慢指针求中间元素问题,一遍过哈哈
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* middleNode(struct ListNode* head){
struct ListNode *fast = head->next;
struct ListNode *slow = head;
while(fast!=NULL){
if(fast->next == NULL){
slow = slow->next;
return slow;
}
fast = fast->next->next;
slow = slow->next;
}
return slow;
}