题目网址：https://oj.leetcode.com/problems/add-two-numbers/题目描述：You are given two linked lists representing two non-negative numbers. The digits are stored...
分类：
其他好文 时间：
2014-12-06 20:19:23
阅读次数：
196
DECLARE @Start INT = 1; --开始DECLARE @Digits INT = 6; --后几位DECLARE @prefix VARCHAR(50) = '0990';--前缀DECLARE @end INT=500000; --结束SET @Start = 1WHILE @S...
分类：
其他好文 时间：
2014-12-05 15:27:55
阅读次数：
175
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Find the total sum ...
分类：
其他好文 时间：
2014-12-04 21:39:20
阅读次数：
209
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"25525511135",return["255.2...
分类：
其他好文 时间：
2014-12-03 22:50:26
阅读次数：
136
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...
分类：
其他好文 时间：
2014-12-03 19:03:24
阅读次数：
169
Time Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 820 Accepted Submission(s):
202
Problem Description
Given a positive integer n, yo...
分类：
其他好文 时间：
2014-12-03 00:30:09
阅读次数：
280
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"25525511135",return["255.2...
分类：
其他好文 时间：
2014-12-02 22:12:13
阅读次数：
163
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...
分类：
其他好文 时间：
2014-11-29 07:05:11
阅读次数：
208
Given a non-negative number represented as an array of digits, plus N to the number.The digits are stored such that the most significant digit is at t...
分类：
其他好文 时间：
2014-11-29 07:05:00
阅读次数：
185
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 ...
分类：
其他好文 时间：
2014-11-29 06:59:16
阅读次数：
153
