Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leadin ...
分类:
其他好文 时间:
2017-07-20 12:47:55
阅读次数:
162
Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example:Given"25525511135", return["255 ...
分类:
其他好文 时间:
2017-07-19 19:32:45
阅读次数:
147
Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here a ...
分类:
其他好文 时间:
2017-07-18 11:57:20
阅读次数:
178
Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 Note:The input is assumed to be a 32-bit signed integer. Yo ...
分类:
其他好文 时间:
2017-07-17 15:17:04
阅读次数:
207
【066-Plus One(加一)】 【LeetCode-面试算法经典-Java实现】【全部题目文件夹索引】 原题 Given a non-negative number represented as an array of digits, plus one to the number. The d ...
分类:
编程语言 时间:
2017-07-16 16:34:35
阅读次数:
157
原题链接:https://leetcode.com/problems/reverse-integer/ 题目: Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 cl ...
分类:
其他好文 时间:
2017-07-16 13:38:48
阅读次数:
211
Link: https://leetcode.com/problems/sum-root-to-leaf-numbers/ Given a binary tree containing digits from 0-9 only, each root-to-leaf path could repres ...
分类:
其他好文 时间:
2017-07-13 20:21:31
阅读次数:
162
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: ...
分类:
其他好文 时间:
2017-07-12 13:37:36
阅读次数:
156
Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 click to show spoilers. Note:The input is assumed to be a 3 ...
分类:
其他好文 时间:
2017-07-12 01:08:59
阅读次数:
145
258. 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 ...
分类:
其他好文 时间:
2017-07-09 23:10:22
阅读次数:
163