insert first when deptno=10 then into dept01(id) values(deptno) when deptno=20 then into dept02(id) values(deptno) else into d...
分类:
其他好文 时间:
2014-11-09 19:23:55
阅读次数:
139
Binary Tree Level Order TraversalGiven a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).Fo...
分类:
其他好文 时间:
2014-11-09 16:26:48
阅读次数:
127
这道题A的略烦Binary Tree Level Order Traversal IIGiven a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right...
分类:
其他好文 时间:
2014-11-09 15:09:19
阅读次数:
238
4 Values whose Sum is 0
Time Limit: 15000MS
Memory Limit: 228000K
Total Submissions: 16000
Accepted: 4625
Case Time Limit: 5000MS
Description
The SUM problem can...
分类:
其他好文 时间:
2014-11-09 14:02:26
阅读次数:
123
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For ...
分类:
其他好文 时间:
2014-11-09 06:13:51
阅读次数:
122
一、使用XML布局文件控制UI界面res\layout\activity_main.xml代码如下: 一个TextView组件用于显示提示文字,一个在窗体正中间显示开始游戏按钮其中res\values\styles.xml代码如下 用于指定应用的样式,指定文字的大小和颜色。最后在主活动中也就是...
分类:
移动开发 时间:
2014-11-09 00:50:56
阅读次数:
264
Binary Tree Preorder TraversalGiven a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ ...
分类:
其他好文 时间:
2014-11-08 23:36:00
阅读次数:
202
题意:
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
2
/
3
return [1,3,2].
Note: Recursive solution is trivial, could you do it iteratively?...
分类:
其他好文 时间:
2014-11-08 19:43:46
阅读次数:
188
题意:
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
2
/
3
return [1,2,3].
Note: Recursive solution is trivial, could you do it iteratively?...
分类:
其他好文 时间:
2014-11-08 13:41:21
阅读次数:
155
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
分类:
其他好文 时间:
2014-11-08 13:35:55
阅读次数:
144