Reverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321 1 class Solution { 2 public: 3 int reverse(int x){ 4 ...
分类：
其他好文 时间：
2014-07-26 13:54:24
阅读次数：
206
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"25525511135",return["255.2...
分类：
其他好文 时间：
2014-07-26 00:05:16
阅读次数：
301
题目: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 sin....
分类：
编程语言 时间：
2014-07-24 10:01:23
阅读次数：
223
题目链接：uva 1341 - Different Digits
题目大意：给定一个数字n，要求求一个数字m，m可以整除n，并且尽量组成的数字种类(0~9)尽量少，在种类相同的情况下数值尽量小。
解题思路:可以证明两种数字肯定可以组成m，假设有数字k，一种数字可以有k，kk，kkk，kkkk，…整除n剩的数一定在0~n-1之间，所以肯定存在两个由k数字组成的数字同模，那么这两个数相减所...
分类：
其他好文 时间：
2014-07-23 20:57:35
阅读次数：
272
A message containing letters from A-Z is being encoded to numbers using the following mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26
Given an encoded message containing digits, determine the total numb...
分类：
其他好文 时间：
2014-07-23 17:06:05
阅读次数：
324
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-07-23 16:51:51
阅读次数：
251
The trick is, we can work on a reversed vector - learnt from EPI.class Solution {public: vector plusOne(vector &digits) { std::reverse(digit...
分类：
其他好文 时间：
2014-07-22 00:33:36
阅读次数：
223
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-07-21 09:14:10
阅读次数：
168
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-07-20 22:12:03
阅读次数：
251
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-07-20 21:32:55
阅读次数：
250
