2018年5月23日
[LeetCode] Number of Digit One
摘要： Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n. Example: Input: 13 Output: 6 Exp 阅读全文
posted @ 2018-05-23 21:23 immjc 阅读(92) 评论(0) 推荐(0)
[LeetCode] Flatten Binary Tree to Linked List
摘要： Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look 阅读全文
posted @ 2018-05-23 11:54 immjc 阅读(130) 评论(0) 推荐(0)