(将有序数组转成平衡二叉树)LeetCode#108. Convert Sorted Array to Binary Search Tree

来源:互联网 发布:私有域名解析软件 编辑:程序博客网 时间:2024/05/16 01:43
  • 题目:给定有序数组,将有序数组转成二叉平衡树
  • 难度:Easy
  • 思路:根据二叉平衡树的性质,可采用二分查找来确定节点
  • 代码:
public class Solution {    public TreeNode sortedArrayToBST(int[] nums) {        if(nums == null || nums.length == 0){            return null;        }        return helper(nums, 0, nums.length-1);    }    public TreeNode helper(int[] nums, int left, int right){        if(left <= right){            int mid = left + (right-left)/2;            TreeNode node = new TreeNode(nums[mid]);            node.left = helper(nums, left, mid-1);            node.right = helper(nums, mid+1, right);            return node;        }else{            return null;        }    }}
阅读全文
0 0
原创粉丝点击