Implement strStr()问题及解法

    xiaoxiao2021-03-25  130

    问题描述:

    Implement strStr().

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

    问题分析:

    返回needle串在haystack串中首次出现的位置,若没有出现,则返回-1;

    详细过程请看我的代码:

    class Solution { public: int strStr(string haystack, string needle) { int index = -1; int len = haystack.length(); int len2 = needle.length(); if(len < len2) return -1; for(int i = 0 ; i <= len - len2; i++) { index = i; for(int j = 0; j < len2; j++) { if(needle[j] != haystack[i + j]) { index = -1; break; } } if(index != -1) break; } return index; } };

    转载请注明原文地址: https://ju.6miu.com/read-21653.html

    最新回复(0)