- 博客(3)
- 收藏
- 关注
转载 [Leetcode] PlusOne
问题描述 Given a number represented as an array of digits, plus one to the number. 代码 public class Solution { public int[] plusOne(int[] ...
2013-07-10 17:04:00
103
转载 [leetcode][Binary Tree Inorder Traversal]
最简单的二叉树中序遍历题目,其实我比较好奇的输入的“#”,如何被识别为null。难度系数1/5 Given a binary tree, return the inorder traversal of its nodes' values. For example: Giv...
2013-07-01 15:52:00
68
转载 [leetcode][Climbing Stairs]
5月份面试时也被问到相同的问题,第一次使用leetcode,这种OJ的代码机制很有意思啊 “ You are climbing a stair case. It takes n steps to reach to the top. Each time you can eit...
2013-07-01 11:52:00
93
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人
RSS订阅