[leetcode] 109. Convert Sorted List to Binary Search Tree

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

解法一：

思路就是用快慢指针获得list的中心，然后把中心之前的list和中心之后的list（inclusive)分别变成bst。这里要注意的是使用一个last，记录slow之前的位置，将last->next设为NULL。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* sortedListToBST(ListNode* head) {
        if(!head) return NULL;
        if(!head->next){
            TreeNode* res = new TreeNode(head->val);
            return res;
        }
        ListNode* fast = head, *slow = head, *last = head;
        while(fast->next&&fast->next->next){
            last = slow;
            slow = slow->next;
            fast = fast->next->next;
        }
        
        fast = slow->next;
        last->next = NULL;
        TreeNode* res = new TreeNode(slow->val);
        if(head!= slow) res->left = sortedListToBST(head);
        res->right = sortedListToBST(fast);
        
        return res;
    }
};