leetcode implement-strstr

pynash123

于 2019-04-07 16:23:56 发布

阅读量86

点赞数

分类专栏： leetcode 算法

本文链接：https://blog.csdn.net/pynash123/article/details/84588623

版权

算法同时被 2 个专栏收录

94 篇文章 0 订阅

订阅专栏

leetcode

50 篇文章 0 订阅

订阅专栏

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

class Solution {
public:
    char *strStr(char *haystack, char *needle) 
    {
        if (NULL == haystack || needle == NULL)
            return NULL;
        int m = strlen(haystack), n = strlen(needle), j=0;;
        for(int i=0;i<=m-n;i++)
        {
            for (j=0;j<n;j++)
                if (*(haystack+i+j) != *(needle+j))
                    break;
            if (j == n)
                return haystack+i;
        }
        return NULL;
    }
};

测试

#include<iostream>
#include<string.h>
using namespace std;
class Solution {
public:
    char *strStr(char *haystack, char *needle) 
    {
        if (NULL == haystack || needle == NULL)
            return NULL;
        int m = strlen(haystack), n = strlen(needle), j=0;;
        for(int i=0;i<=m-n;i++)
        {
            for (j=0;j<n;j++)
                if (*(haystack+i+j) != *(needle+j))
                    break;
            if (j == n)
                return haystack+i;
        }
        return NULL;
    }
};
int main()
{
    Solution s;
    char *p1 = "asdfzaczdf";
    char *p2 = "zaczdf";
    char * res = s.strStr(p1,p2);
    cout<<res<<endl;
}