zoukankan      html  css  js  c++  java
  • [LeetCode] Implement strStr()

    Implement strStr().

    Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

    Update (2014-11-02):
    The signature of the function had been updated to return the index instead of the pointer. If you still see your function signature returns a char * or String, please click the reload button  to reset your code definition.

    思路:没用KMP,直接字符串比较,O(m*n)

    class Solution {
        public:
            int strStr(char *haystack, char *needle) {
    
                int hayLen = strlen(haystack);
                int needLen= strlen(needle);
    
                for(int i = 0; i <= hayLen-needLen; i++)
                {
                    int k = i;
                    int j = 0;
                    for(/* */; j <needLen; /* */)
                    {
                        if(haystack[k] == needle[j])
                        {
                            k++;
                            j++;
                        }
                        else
                            break;
                    }
                    if(j == needLen)
                        return i;
                }
                return -1;
    
            }
    };
  • 相关阅读:
    idea--不能启动问题
    linux--mysql5.7安装
    vmware
    debezium
    java枚举
    springfox
    日志级别
    lombok--知识点
    es6--箭头函数
    网址访问过慢
  • 原文地址:https://www.cnblogs.com/diegodu/p/4280086.html
Copyright © 2011-2022 走看看