- 博客(5)
- 收藏
- 关注
RSS订阅原创 leetcode 258 ：Add Digits
1、原题如下 Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one
2015-09-30 15:03:43
278
原创 leetcode263 : Ugly Number
1、原题如下 Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly sin
2015-09-29 22:16:38
311
原创 leetcode283 : Move Zeroes
1、原题如下 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], after calling yo
2015-09-29 21:42:27
280
原创 leetcode278：First Bad Version
1、原题如下： You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed base
2015-09-29 16:06:05
388
转载 欢迎使用CSDN-markdown编辑器
欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来，用它写博客，将会带来全新的体验哦： Markdown和扩展Markdown简洁的语法 代码块高亮 图片链接和图片上传 LaTex数学公式 UML序列图和流程图 离线写博客 导入导出Markdown文件 丰富的快捷键 快捷键 加粗 Ctrl + B 斜体 Ctrl + I 引用 Ctrl
2015-09-29 15:45:17
236
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人