一. 迭代.
1. 时间O(n), 空间O(1).
/**
* 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* slow = head;
ListNode* fast = head;
while(fast!=NULL && fast->next!=NULL) {
slow = slow->next;
fast = fast->next->next;
}
//slow必然是中间节点.
return slow;
}
};