leetcode
文章平均质量分 84
leonharddt
这个作者很懒,什么都没留下…
展开
-
[Easy]C++ 第一期 6道
400. Nth Digit正整数列的第n位数Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...Note:n is positive and will fit within the range of a 32-bit signed integer (n < 231...原创 2017-07-12 14:08:25 · 318 阅读 · 0 评论 -
[Easy]C++ 第二期 7道
104. Maximum Depth of Binary Tree二叉树最大深度Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthes原创 2017-11-22 21:04:21 · 269 阅读 · 0 评论