[leetcode]Implement strStr().

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

Example 1:

Input: haystack = "hello", needle = "ll"
Output: 2

Clarification:

What should we return when needle is an empty string? This is a great question to ask during an interview.

For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().

分析：

返回haystack中首次出现needle的索引，不存在则返回-1，needle为空则返回0。依次比较j与i中字符，若完全相同，则返回相应的下标，否则继续与i中下一字符比较，直至遍历完i中所有字符。

class Solution {
public:
    int strStr(string haystack, string needle) {
        if(needle.size() == 0)
            return 0;
        if(haystack.size() < needle.size())
            return -1;
        int i = 0;//haystack下标
        int j = 0;//needle下标
        while(i <= haystack.size()-1 && j <= needle.size()-1) 
        {
            if(haystack[i] == needle[j])
            {
                i++;
                j++;
            }
            else
            {
                i = i-j+1;
                j = 0;
            }
        
        }
        if(j == needle.size())
            return i-j;
        else
            return -1;
        
    }
};