我觉着写得比看到的答案更清晰~
class Solution {
public:
TreeNode *ltob(ListNode *head, ListNode *end) {
if(head == end) {
TreeNode * node = new TreeNode(head->val);
return node;
}
ListNode *slow = head, *fast = head, *pre = NULL;
while(fast != end && fast->next != end) {
pre = slow, slow = slow->next, fast = fast->next->next;
}
TreeNode *node = new TreeNode(slow->val);
if(pre) node->left = ltob(head, pre);
node->right = ltob(slow->next,end);
return node;
}
TreeNode *sortedListToBST(ListNode *head) {
if(head == NULL) return NULL;
ListNode *end = head;
while(end->next) end = end->next;
return ltob(head, end);
}
};