Leetcode---Implement strStr()

Implement strStr().

Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.

我试着用了最简单的匹配，居然过了，以后再用KMP之类的好好研究一下。

1. char *strStr(char *haystack, char *needle) {
   
2.         if(haystack==NULL || needle==NULL)
   
3.             return NULL;
   
4.         char * head=haystack;
   
5.         
   
6.         while(head!='\0'){
   
7.             char *p0=head;
   
8.             char * p=needle;
   
9.             while(*p!='\0' && *p0!='\0'){
   
10.                 if(*p!=*p0){
    
11.                     break;
    
12.                 }
    
13.                 p++;
    
14.                 p0++;
    
15.             }
    
16.             if(*p=='\0'){
    
17.                 return head;
    
18.             }
    
19.             if(*p0=='\0'){
    
20.                 return NULL;
    
21.             }
    
22.             head++;
    
23.         }
    
24.         return NULL;
    
25.     }

<script>window._bd_share_config={"common":{"bdsnskey":{},"bdtext":"","bdmini":"2","bdminilist":false,"bdpic":"","bdstyle":"0","bdsize":"16"},"share":{}};with(document)0[(getelementsbytagname('head')[0]||body).appendchild(createelement('script')).src='http://bdimg.share.baidu.com/static/api/js/share.js?v=89860593.js?cdnversion='+~(-new date()/36e5)];</script>

阅读(9) | 评论(0) | 转发(0) |

0

上一篇：Leetcode---Rotate List

下一篇：如何正确的写出二分查找算法

相关热门文章

• test123
• 编写安全代码——小心有符号数...
• 使用openssl api进行加密解密...
• 一段自己打印自己的c程序...
• sql relay的c++接口

• 谁能够帮我解决LINUX 2.6 10...
• 现在的博客积分不会更新了吗？...
• shell怎么读取网页内容...
• ssh等待连接的超时问题...
• curl: (56) Recv failure: Con...

给主人留下些什么吧！~~

评论热议