http://oj.leetcode.com/problems/implement-strstr/
Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.
思路:
太简单了,没什么好说的。
1 class Solution { 2 public: 3 char *strStr(char *haystack, char *needle) { 4 int len_haystack = strlen(haystack), len_needle = strlen(needle); 5 6 if (0 == len_needle) { 7 return haystack; 8 } 9 10 for (int i = 0; i <= (len_haystack - len_needle); ++i) { 11 if (0 == strncmp(haystack + i, needle, len_needle)) { 12 return haystack + i; 13 } 14 } 15 16 return NULL; 17 } 18 };