思路:使用递归的方式,每次取数组中间的值比如m作为当前节点,m前面的值作为他左子树的结点值,m后面的值作为他右子树的节点值,答案不唯一,但题目说了这个结果是正确的。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
if (nums.length == 0) {
return null;
}
return sortedArrayToBST(nums, 0, nums.length - 1);
}
public TreeNode sortedArrayToBST(int []nums, int i, int j) {
// i为起点,j为终点
if (i > j) {
return null;
}
int mid = (i + j) / 2;
TreeNode root = new TreeNode (nums[mid]);
root.left = sortedArrayToBST(nums, i, mid-1);
root.right = sortedArrayToBST(nums, mid+1, j);
return root;
}
}