题目链接：https://leetcode.com/problems/add-digits/
题目：
Given a non-negative integer num, repeatedly add all its digits until the
result has only one digit.
For example:
Given num = 38, the pro...
分类：
其他好文 时间：
2015-08-25 23:53:39
阅读次数：
174
Revolving Digits Problem's Link: http://acm.hdu.edu.cn/showproblem.php?pid=4333 Mean:给你一个字符串，你可以将该字符串的任意长度后缀截取下来然后接到最前面，让你统计所有新串中有多少种字典序小于、等于、大...
分类：
其他好文 时间：
2015-08-25 23:40:47
阅读次数：
268
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 nu...
分类：
其他好文 时间：
2015-08-25 21:52:38
阅读次数：
137
Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3 + ...
分类：
编程语言 时间：
2015-08-25 16:31:53
阅读次数：
153
题目：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...
分类：
其他好文 时间：
2015-08-25 16:14:55
阅读次数：
190
Add Two Numbers You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes c...
分类：
其他好文 时间：
2015-08-25 16:14:15
阅读次数：
170
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: 3
+ 8 = 11, 1 + 1 = 2. Since 2 has
on...
分类：
其他好文 时间：
2015-08-21 15:37:26
阅读次数：
147
Description：Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process ...
分类：
其他好文 时间：
2015-08-20 22:31:12
阅读次数：
241
先用KMP问题结局循环节的问题，再用拓展kmp解决
#include
#include
#define maxn 200010
using namespace std;
string str,b;
int nextt[maxn],extend[maxn];
void get_next()
{
int a=0;
nextt[0]=b.size();
while(a<b.size()-1&&b...
分类：
其他好文 时间：
2015-08-20 16:53:33
阅读次数：
113
Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3 + ...
分类：
其他好文 时间：
2015-08-19 19:36:09
阅读次数：
115
