leetcode (28) - Implement strStr()

strstr(str1,str2) 函数用于判断字符串str2是否是str1的子串。如果是，则该函数返回str2在str1中首次出现的地址；否则，返回NULL。

int strStr(char* haystack, char* needle) {
    int i = 0, j=0, index=0;
    int found=0, flag=0;
   
    
    if (strcmp(haystack, "")==0 && strcmp(needle, "")!=0)  {
        return -1;
    }
    
    if (strcmp(haystack, "")!=0 && strcmp(needle, "")==0)  {
        return 0;
    }
    
    while(haystack[j] !='\0' && needle[i] != '\0') {
        
        if(haystack[j] != needle[i]) {
            i=0;
            if(flag==1) j=index;
            flag=0;
            
            printf("%c, %c\n", haystack[j], needle[i]);
           
        } else {
            
            if(flag==0) {
                
                index=j;
                flag=1;
              
            }
            
            printf("=====%c, %c\n", haystack[j], needle[i]);
            
            i++;
            
        }
        
        j++;
        
        
    }
    
    if(needle[i]=='\0') return index;
    
    return -1;
    
}