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-28 06:10:40
阅读次数：
259
问题描述：
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 digit. Add the two numbers and return it ...
分类：
其他好文 时间：
2014-11-27 23:42:16
阅读次数：
239
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"25525511135",return["255.2...
分类：
其他好文 时间：
2014-11-27 18:16:58
阅读次数：
170
Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are ...
分类：
其他好文 时间：
2014-11-27 10:36:47
阅读次数：
232
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
Have you thought about this?
Here are some good questions to ask before c...
分类：
其他好文 时间：
2014-11-27 09:15:14
阅读次数：
178
BackgroundThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that dig...
分类：
其他好文 时间：
2014-11-26 20:37:15
阅读次数：
145
m位长度，S为各位的和利用贪心的思想逐位判断过去即可详细的注释已经在代码里啦~//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler#include #include #include #include #include #in...
分类：
其他好文 时间：
2014-11-26 18:35:55
阅读次数：
125
Sum Root to Leaf NumbersGiven a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-l...
分类：
其他好文 时间：
2014-11-26 10:51:51
阅读次数：
169
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-26 01:05:29
阅读次数：
166
Add Two NumbersYou are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes co...
分类：
其他好文 时间：
2014-11-25 14:09:53
阅读次数：
171
