leetcode
justyou8023
这个作者很懒,什么都没留下…
展开
-
Add Digits
Add DigitsTotal Accepted: 46491 Total Submissions: 97958 Difficulty: EasyGiven a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:原创 2015-11-26 20:24:25 · 244 阅读 · 0 评论 -
Maximum Depth of Binary Tree
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 farthest leaf node.原创 2015-11-26 20:52:17 · 249 阅读 · 0 评论 -
Move Zeroes
Move Zeroes Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], a原创 2015-11-27 10:00:15 · 298 阅读 · 0 评论