题目链接在字符串a中查找字符串b出现的次数...貌似不可以用a.count()附上代码:1 a = 
raw_input().strip()2 b = raw_input().strip()3 cnt = 0;4 for i in 
xrange(len(a)):5 cnt += 1 if a....
                            
                            
                                分类:
其他好文   时间:
2014-05-14 04:13:06   
                                阅读次数:
308
                             
                    
                        
                            
                            
                                题目
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.
For "(()", the longest valid parentheses substring is "()", ...
                            
                            
                                分类:
其他好文   时间:
2014-05-14 01:10:30   
                                阅读次数:
318
                             
                    
                        
                            
                            
                                Bob enjoys playing computer games, especially 
strategic games, but sometimes he cannot find the solution fast enough and then 
he is very sad. Now he h...
                            
                            
                                分类:
其他好文   时间:
2014-05-14 00:29:42   
                                阅读次数:
251
                             
                    
                        
                            
                            
                                TriangleGiven a triangle, find the minimum path 
sum from top to bottom. Each step you may move to adjacent numbers on the row 
below.For example, given...
                            
                            
                                分类:
其他好文   时间:
2014-05-13 18:51:44   
                                阅读次数:
297
                             
                    
                        
                            
                            
                                判断shutcut是否安装
"com.android.launcher.permission.READ_SETTINGS"/>
这段代码在模拟器上运行没有问题,但是在htc s510e运行报异常Failed to find provider info for com.android.launcher2.settings
通过但因htc所有包发现htc中的launcher被定制了改名为co...
                            
                            
                                分类:
移动开发   时间:
2014-05-12 23:58:28   
                                阅读次数:
625
                             
                    
                        
                            
                            
                                Multiple annotations found at this line:	- schema_reference.4: Failed to read schema document 'http://www.directwebremoting.org/schema/spring-dwr-2.0.xsd', because 1) could not find the document; 	 2)...
                            
                            
                                分类:
编程语言   时间:
2014-05-12 22:55:47   
                                阅读次数:
409
                             
                    
                        
                            
                            
                                You are given a string, S, and a list of words, 
L, that are all of the same length. Find all starting indices of substring(s) in 
S that is a concatena...
                            
                            
                                分类:
其他好文   时间:
2014-05-12 22:27:04   
                                阅读次数:
265
                             
                    
                        
                            
                            
                                原题地址:http://oj.leetcode.com/problems/minimum-depth-of-binary-tree/题意:Given 
a binary tree, find its minimum depth.The minimum depth is the number of no...
                            
                            
                                分类:
编程语言   时间:
2014-05-12 21:55:15   
                                阅读次数:
348
                             
                    
                        
                            
                            
                                自己写的一段://goolchar* str_replace(char* source, 
const char* find, const char* replace){	if (source == NULL || find == NULL || 
find == "") return strdup.....
                            
                            
                                分类:
其他好文   时间:
2014-05-12 02:42:20   
                                阅读次数:
418
                             
                    
                        
                            
                            
                                ind是一个基于查找的功能非常强大的命令,相对而言,它的使用也相对较为复杂,参数也比较多,所以在这里将给把它们分类列出,它的基本语法如下:find[PATH][option][action]#与时间有关的参数:-mtimen:n为数字,意思为在n天之前的“一天内”被更改过的文件;-mtime+n:列...
                            
                            
                                分类:
其他好文   时间:
2014-05-12 02:01:20   
                                阅读次数:
327