Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tre...
                            
                            
                                分类:
其他好文   时间:
2014-10-22 12:29:07   
                                阅读次数:
171
                             
                    
                        
                            
                            
                                Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never diffe...
                            
                            
                                分类:
其他好文   时间:
2014-10-22 01:06:01   
                                阅读次数:
162
                             
                    
                        
                            
                            
                                Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 1 /** 2 * Definition for singly-linked ....
                            
                            
                                分类:
其他好文   时间:
2014-10-21 03:33:45   
                                阅读次数:
168
                             
                    
                        
                            
                            
                                [leetcode]Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST....
                            
                            
                                分类:
其他好文   时间:
2014-10-20 11:49:53   
                                阅读次数:
114
                             
                    
                        
                            
                            
                                既然是bronze,毫无压力的AC了.就是个深搜,当然加个剪枝--最后一个组不用搜.恩可以一个一个组分层次dfs,这样会跑得飞起~~也不容易错#include int f[13],i,su,tt1,tt2,lev[4],min;bool has[13];inline int md(int a,int...
                            
                            
                                分类:
其他好文   时间:
2014-10-19 23:01:39   
                                阅读次数:
270
                             
                    
                        
                            
                            
                                Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.这题和sort list等题都比较相似,需要先用快慢指针的方法找到链表的中点,然后...
                            
                            
                                分类:
其他好文   时间:
2014-10-16 22:31:43   
                                阅读次数:
217
                             
                    
                        
                            
                            
                                【题目】
Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never d...
                            
                            
                                分类:
其他好文   时间:
2014-10-12 22:29:28   
                                阅读次数:
210
                             
                    
                        
                            
                            
                                问题: Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the ...
                            
                            
                                分类:
其他好文   时间:
2014-10-12 17:56:48   
                                阅读次数:
154
                             
                    
                        
                            
                            
                                /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; ...
                            
                            
                                分类:
其他好文   时间:
2014-10-12 07:47:07   
                                阅读次数:
168
                             
                    
                        
                            
                            
                                判断给定的二叉树是否是平衡二叉树,即每一个节点的深度相差不大于1...
                            
                            
                                分类:
其他好文   时间:
2014-10-10 01:29:03   
                                阅读次数:
194