[LeetCode] 108.Convert Sorted Array to Binary Search Tree 將有序數(shù)組轉(zhuǎn)為二叉搜索樹(shù)

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of everynode never differ by more than 1.

Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
/ \
-3   9
/   /
-10  5 

這道題是要將有序數(shù)組轉(zhuǎn)為二叉搜索樹(shù)，所謂二叉搜索樹(shù)，是一種始終滿(mǎn)足左<根<右的特性，如果將二叉搜索樹(shù)按中序遍歷的話(huà)，得到的就是一個(gè)有序數(shù)組了。那么反過(guò)來(lái)，我們可以得知，根節(jié)點(diǎn)應(yīng)該是有序數(shù)組的中間點(diǎn)，從中間點(diǎn)分開(kāi)為左右兩個(gè)有序數(shù)組，在分別找出其中間點(diǎn)作為原中間點(diǎn)的左右兩個(gè)子節(jié)點(diǎn)，這不就是是二分查找法的核心思想么。所以這道題考的就是二分查找法，代碼如下：

解法一：

class Solution {
public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        return helper(nums, 0 , (int)nums.size() - 1);
    }
    TreeNode* helper(vector<int>& nums, int left, int right) {
        if (left > right) return NULL;
        int mid = left + (right - left) / 2;
        TreeNode *cur = new TreeNode(nums[mid]);
        cur->left = helper(nums, left, mid - 1);
        cur->right = helper(nums, mid + 1, right);
        return cur;
    }
};

我們也可以不使用額外的遞歸函數(shù)，而是在原函數(shù)中完成遞歸，由于原函數(shù)的參數(shù)是一個(gè)數(shù)組，所以當(dāng)把輸入數(shù)組的中間數(shù)字取出來(lái)后，需要把所有兩端的數(shù)組組成一個(gè)新的數(shù)組，并且分別調(diào)用遞歸函數(shù)，并且連到新創(chuàng)建的cur結(jié)點(diǎn)的左右子結(jié)點(diǎn)上面，參見(jiàn)代碼如下：

解法二：

class Solution {
public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        if (nums.empty()) return NULL;
        int mid = nums.size() / 2;
        TreeNode *cur = new TreeNode(nums[mid]);
        vector<int> left(nums.begin(), nums.begin() + mid), right(nums.begin() + mid + 1, nums.end());
        cur->left = sortedArrayToBST(left);
        cur->right = sortedArrayToBST(right);
        return cur;
    }
};

類(lèi)似題目：

Convert Sorted List to Binary Search Tree

參考資料：

https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/

https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/discuss/35220/My-Accepted-Java-Solution

https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/discuss/35394/6-lines-Java-Accepted-Solution

到此這篇關(guān)于C++實(shí)現(xiàn)LeetCode(108.將有序數(shù)組轉(zhuǎn)為二叉搜索樹(shù))的文章就介紹到這了,更多相關(guān)C++實(shí)現(xiàn)將有序數(shù)組轉(zhuǎn)為二叉搜索樹(shù)內(nèi)容請(qǐng)搜索腳本之家以前的文章或繼續(xù)瀏覽下面的相關(guān)文章希望大家以后多多支持腳本之家！

最新評(píng)論