108. Convert Sorted Array to Binary Search Tree
发布时间:2020-12-14 03:45:21 所属栏目:大数据 来源:网络整理
导读:1 class Solution { 2 public TreeNode sortedArrayToBST( int [] nums) { 3 int size = nums.length; 4 return helper(nums,size - 1 ); 5 6 } 7 8 public TreeNode helper( int [] nums, int lo, int hi) { 9 if (lo hi) return null ; 10 int mid = lo +
1 class Solution { 2 public TreeNode sortedArrayToBST(int[] nums) { 3 int size = nums.length; 4 return helper(nums,size - 1); 5 6 } 7 8 public TreeNode helper(int[] nums,int lo,int hi) { 9 if(lo > hi) return null; 10 int mid = lo + (hi - lo) / 2; 11 TreeNode root = new TreeNode(nums[mid]); 12 root.left = helper(nums,lo,mid-1); 13 root.right = helper(nums,mid+1,hi); 14 return root; 15 } 16 } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |