108. Convert Sorted Array to Binary Search Tree

原题

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 every node 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

翻译

给定一个元素按升序排好的数组, 把他转化成高度平衡的二叉搜索树.

对于这个问题, 高度平衡二叉树就是其中每个节点的两个子树的深度差别不超过1的二叉树.

例:

给定一个排好序的数组: [-10,-3,0,5,9],

一种可能的回答是: [0,-3,9,-10,null,5], 它代表了下面这个高度平衡二叉树。

      0
     / \
   -3   9
   /   /
 -10  5

程序

失败的思路

/**
 * 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) {
        if(nums.size()==0)return NULL;
        TreeNode* root;
        if(nums.size()==1)return new TreeNode(nums[0]);
        
        TreeNode* temp=new TreeNode(nums[0]);
        if(nums.size()==2)
        {
            temp->right = new TreeNode(nums[1]);
            return temp;
        }
        int half = nums.size()/2;
        for (int i = 1; i<nums.size(); ++i,--half)
	    {
            
            TreeNode* newNode = new TreeNode(nums[i]);
            if(half>0)
            {
                if(nums[i]>nums[i-1])newNode->left = temp;
                else newNode->right = temp;
                temp = newNode;
            }
            else if(half==0)
            {
                root=temp;
                temp->right = newNode;
                temp = newNode;
            }
            else
            {
                if(nums[i]<nums[i-1])temp->left = newNode;
                else temp->right = newNode;
                temp = newNode;
            }
        }
        return root;
    }
};

成功的思路

//二分法思路
class Solution {
public:
    TreeNode* sort(vector<int>& nums,int start,int end)
    {
    	//start>end时就代表无可再分，结束了
    	//start==end时是将自身创建了一个节点
        if(start>end)return NULL;  
        int mid = start+(end-start)/2;
        
        TreeNode* node = new TreeNode(nums[mid]);
        node->left = sort(nums, start, mid-1);
        node->right = sort(nums, mid+1, end);
        return node;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        return sort(nums,0,nums.size()-1);
    }
};

总结

1. 理解二分法中点的确定，以及为什么start>end时结束
2. 基础算法掌握不牢，导致错误思路出现