zoukankan      html  css  js  c++  java
  • LeetCode:108 将有序数组转换为二叉搜索树

    class Solution {
    
        public TreeNode Build(int[]nums,int left,int right){
            if(left>right){
                return null;
            }
            int mid = (left+right)>>1;
            TreeNode t = new TreeNode(nums[mid]);
            t.left = Build(nums,left,mid-1);
            t.right = Build(nums,mid+1,right);
            return t;
        }
    
        public TreeNode sortedArrayToBST(int[] nums) {
            if(nums.length==0){
                return null;
            }
            int r = nums.length/2;
            int len = nums.length-1;
            TreeNode root = new TreeNode(nums[r]);
            root.left = Build(nums,0,r-1);
            root.right = Build(nums,r+1,len);
            return root;
        }
    }
  • 相关阅读:
    gflag使用
    INTERVIEW #2
    Decision Tree
    Java FAQ
    K-Nearest Neighbors
    INTERVIEW #1
    C++ FAQ
    INTERVIEW #0
    Selection Sort
    TCP 3-Way Handshake
  • 原文地址:https://www.cnblogs.com/dloooooo/p/13784232.html
Copyright © 2011-2022 走看看