acttell的博客

https://www.cnblogs.com/grandyang/p/7144045.html[LeetCode] 72. Edit Distance 编辑距离https://www.cnblogs.com/grandyang/p/4344107.html

https://www.cnblogs.com/grandyang/p/4424731.htmlhttp://bangbingsyb.blogspot.com/2014/11/leetcode-longest-valid-parentheses.html

https://www.cnblogs.com/grandyang/p/4385822.html

http://www.cnblogs.com/grandyang/p/4030114.htmlhttps://www.cnblogs.com/grandyang/p/5931874.html

https://www.cnblogs.com/grandyang/p/4464476.html

https://www.cnblogs.com/xudong-bupt/archive/2013/03/15/2959039.html

https://www.cnblogs.com/grandyang/p/4648044.html

https://www.cnblogs.com/grandyang/p/4480780.html

https://blog.youkuaiyun.com/moli152_/article/details/44495935 https://www.cnblogs.com/DarrenChan/p/5731004.html

https://www.cnblogs.com/grandyang/p/5420836.html

一个串是不是另一个串的旋转 https://www.cnblogs.com/grandyang/p/4653373.htmlhttp://www.cnblogs.com/grandyang/p/9251578.html

https://blog.youkuaiyun.com/hackbuteer1/article/details/6666959

https://www.cnblogs.com/noryes/p/5716669.html

https://www.cnblogs.com/grandyang/p/4125537.html

定义左旋操作：把前面的若干字符移到字符串尾部。"abcdef"左旋2位得"cdefab"。思路：左旋相当于AB变成BA。把A翻转后记为A(T),有(A(T))T=A。首先对A B分别翻转，得到A(T)B(T)。再对A(T)B(T)翻转，得到(A(T)B(T))(T)=(B(T))(T)(A(T))(T)=BA。把字符串分成A B两段，翻转三次就行了。...

字符串"345"，则输出整数345。思路：考虑正负号，溢出情形遍历字符串，减‘0’，乘10

例如“I am a student.”，则“student. a am I”。思路：先整个反转，再对空格隔开的每个单词反转，快慢指针。

//判定字符串形式IP是否有效#include"stdio.h"#include"string.h"void main(){ char str[17]; int a = 0; int b = 0; int c = 0; int d = 0; while (fgets(str, sizeof(str), stdin) != NULL) {

//两个字符串A、B,从A中剔除存在于B中的字符。 //比如A = “hello world”, B = “her”， //那么剔除之后A变为 “llo wold”//ANSCII码总共256个字符。 //暴力思路，每删除A中一个元素都将A后面的所有元素前移， //若A中n个字符，时间复杂度是O(n^2)。 //可以这样，设置两个指向A的快慢指针，时间复杂度就降低到了O(n)。逻辑是：