/**
* 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 dfs(nums, 0, nums.size()-1);
}
TreeNode* dfs(vector<int>& nums, int left, int right){
if(left > right)
return NULL;
int mid = (left + right)/2;
TreeNode* result = new TreeNode(nums[mid]);
result->right = dfs(nums, mid+1, right);
result->left = dfs(nums, left, mid-1);
return result;
}
};
此题较奇怪,应该是加了一个在最小限制的深度下实现。
总结:对于二叉树等,多考虑递归方法,多总结、