https://leetcode.com/problems/plus-one/题目：Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored ...
分类：
其他好文 时间：
2015-08-06 22:00:17
阅读次数：
153
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2015-08-05 01:00:13
阅读次数：
106
题目如下：
For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be obta...
分类：
其他好文 时间：
2015-08-04 13:34:40
阅读次数：
134
Different Digits
Time Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1138 Accepted Submission(s): 296
Problem Description
Given a posit...
分类：
其他好文 时间：
2015-08-04 09:28:56
阅读次数：
126
Digits of Pi: In this problem you have to find as many digits of PI as possible.
Output: Output must contain as many digits of PI as possible (not more than 1,000,000).
Score: The score awarded to y...
分类：
其他好文 时间：
2015-08-04 08:13:37
阅读次数：
168
题目 ：Reverse IntegerReverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321题目分析及部分代码解析：1、需要考虑一位数，比如1,2,3等特殊情况，返回本身。2、需要...
分类：
其他好文 时间：
2015-08-04 00:24:22
阅读次数：
163
June 22, 2015Given a number represented as an array of digits, plus one to the number.Leetcode: plus one, 喜欢这道题, 看看有哪些解法; 一个个试过来. (6种方法)Read the web b...
分类：
其他好文 时间：
2015-08-03 06:29:15
阅读次数：
150
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep...
分类：
其他好文 时间：
2015-08-02 23:12:12
阅读次数：
219
DescriptionWrite a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, such that the ...
分类：
其他好文 时间：
2015-08-02 21:20:10
阅读次数：
235
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at...
分类：
其他好文 时间：
2015-08-02 21:19:04
阅读次数：
81
