![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
山峦晴雪
这个作者很懒,什么都没留下…
展开
-
[leetcode] Sqrt(x)
Implement int sqrt(int x). Compute and return the square root of x. 使用牛顿迭代,详见原理 http://blog.punkid.org/2008/02/28/compute-the-square-root-via-newtons-iteration/原创 2013-08-09 13:57:23 · 464 阅读 · 0 评论 -
[leetcode]Maximum Depth of Binary Tree
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ //use the recursion algorithm //原创 2014-10-13 22:00:00 · 284 阅读 · 0 评论 -
[leetcode]
merge two sorted array原创 2014-10-13 22:24:48 · 317 阅读 · 0 评论