您的位置:首页 > 其它

Leetcode 108. Convert Sorted Array to Binary Search Tree

2018-01-11 10:00 447 查看
<c>

/**

 * 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* sortedArrayToBST(vector<int>& nums) {

        return reSolve(nums.begin(), nums.end());

    }

    

private:

    TreeNode* reSolve(auto b, auto e) {

        if (b == e) return nullptr;

        

        auto it = b + (e - b) / 2;

        TreeNode* r = new TreeNode(*it);

        r->left = reSolve(b, it);

        r->right = reSolve(it + 1, e);

        return r;

    }

};

<c>
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: