码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode] 28 - Implement strStr()

时间:2015-08-28 13:10:17      阅读:103      评论:0      收藏:0      [点我收藏+]

标签:

Implement strStr().

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

 

class Solution {
public:
  int strStr(string haystack, string needle) {
    int size0 = haystack.size();
    int size1 = needle.size();
    if (size1 == 0) {
      return 0;
    }
    if (size0 == 0) {
      return -1;
    }
    for (int i = 0; i <= (size0 - size1); ++i) {
      bool same = true;
      for (int j = 0; j < size1; ++j) {
        if (haystack[i +j] != needle[j]) {
          same = false;
          break;
        }
      }
      if(same) {
        return i;
      }
    }
    return -1;
  }
};

 

[LeetCode] 28 - Implement strStr()

标签:

原文地址:http://www.cnblogs.com/shoemaker/p/4765943.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!