代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* middleNode(ListNode* head) {
ListNode *chaster=head,*runner=head;
while(runner->next!=NULL && runner->next->next!=NULL){
runner = runner->next->next;
chaster = chaster->next;
}
if(runner->next!=NULL && runner->next->next == NULL){
chaster = chaster->next;
}
return chaster;
}
};