LeetCode, leetcodeoj

Source: Internet
Author: User

LeetCode, leetcodeoj

Link: 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.

The requirement for this question is to implement the strStr () function and return the position where needle first appeared in the haystack. If it is not found,-1 is returned.

The direct idea of this question is brute force search, which means matching by one character or character. If you are interested, you can study these O (m + n) algorithms: Rabin-Karp Algorithm, KMP algorithm, and Boyer-Moore algorithm.

Time Complexity: O (mn)

Space complexity: O (1)

 1 class Solution 2 { 3 public: 4     int strStr(char *haystack, char *needle) 5     { 6         int l1 = strlen(haystack), l2 = strlen(needle); 7         for(int i = 0, j; i <= l1 - l2; ++ i) 8         { 9             for(j = 0; j < l2 && haystack[i + j] == needle[j]; ++ j);10             if(j == l2)11                 return i;12         }13         return -1;14     }15 };

Reprinted please note the Source: LeetCode --- 28. Implement strStr ()

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.