Leetcode: Convert Sorted Array to Binary Search Tree 理解分析
来源:互联网 发布:乐器软件模拟器 编辑:程序博客网 时间:2024/06/03 13:48
题目大意:给定一个升序的数组,将该数组转换成一个二叉搜索树,且是平衡的。
理解:1)将一个升序排列的数组转换成一个平衡二叉搜索树;
2)根节点单独处理,然后分别递归创建左右子树。注意:将引用传递给另一个方法,该引用是无法传回的。
实现:
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public TreeNode func(int[] s, int low, int high, TreeNode p) { if(low > high) return null; int mid = (low + high) >> 1; p = new TreeNode(s[mid]); p.left = func(s, low, mid - 1, p.left); p.right = func(s, mid + 1, high, p.right); return p; } public TreeNode sortedArrayToBST(int[] num) { if(num == null || num.length == 0) return null; int len = num.length; int mid = len >> 1; TreeNode root = new TreeNode(num[mid]); if(len == 1) return root; if(len == 2) { root.left = new TreeNode(num[0]); return root; } root.left = func(num, 0, mid - 1, root.left); // 创建左子树 root.right = func(num, mid + 1, len - 1, root.right); // 创建右子树 return root; }}
0 0
- Leetcode: Convert Sorted Array to Binary Search Tree 理解分析
- 【LeetCode】Convert Sorted Array to Binary Search Tree && Convert Sorted List to Binary Search Tree
- 【LeetCode】convert-sorted-link-to-binary-search-tree & convert-sorted-array-to-binary-search-tree
- Leetcode - Tree - Convert Sorted Array to Binary Search Tree
- *(leetcode) Convert Sorted Array to Binary Search Tree (tree)
- LeetCode[Tree]: Convert Sorted Array to Binary Search Tree
- LeetCode: Convert Sorted Array to Binary Search Tree
- [LeetCode]Convert Sorted Array to Binary Search Tree
- LeetCode Convert Sorted Array to Binary Search Tree
- [Leetcode] Convert Sorted Array to Binary Search Tree
- leetcode 11: Convert Sorted Array to Binary Search Tree
- Leetcode: Convert Sorted Array to Binary Search Tree
- [LeetCode] Convert Sorted Array to Binary Search Tree
- Leetcode 108 Convert Sorted Array to Binary Search Tree
- Leetcode 108 Convert Sorted Array to Binary Search Tree
- LeetCode Convert Sorted Array to Binary Search Tree
- [LeetCode]Convert Sorted Array to Binary Search Tree
- [Leetcode]Convert Sorted Array to Binary Search Tree
- JDK 7,jdk1.7 安装及配置
- HDU2187
- Timus 1371. Cargo Agency
- Endnot的文献全部转换成BibTex
- Java时间就近取整:<=30分向前取整点,>30分向后取整点
- Leetcode: Convert Sorted Array to Binary Search Tree 理解分析
- 新浪微博授权
- python数据分析
- 牛顿迭代法(牛顿-拉弗森方法(Newton-Raphson method))
- Linux(centos)系统各个目录的作用详解 推荐
- Xcode快捷键
- 教你如何从wireshark中的RTSP流媒体提取H.264码流数据
- 第一个WordCount类运行
- Bresenham改进算法结合wu反走样算法画直线