876. 链表的中间结点

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     struct ListNode *next;
 6  * };
 7  */
 8 
 9 
10 struct ListNode* middleNode(struct ListNode* head){
11     int count = 0;
12     struct ListNode *p = head;
13     while(p)
14     {
15         count++;
16         p=p->next;
17     }
18 
19     int index = count/2+1;
20     count = 0;
21     while(head)
22     {
23         count++;
24         if(count==index){
25             break;
26         }
27 
28         head = head->next;
29     }
30 
31     return head;
32 
33 
34 }