力扣------找到字符串中所有字母异位词

/**
 * Note: The returned array must be malloced, assume caller calls free().
 
 */
int* findAnagrams(char * s, char * p, int* returnSize){
    *returnSize = 0;
    int *returnNums = (int *)malloc(sizeof(int) * strlen(s));
    int a[26]={0};
    int c[26]={0};
    int f=0;
    int g=strlen(s);
    int h=strlen(p);
    if(g<h){
        return returnNums;
    }
    for(int b=0;b<h;b++){
        a[p[b]-'a']=a[p[b]-'a']+1;
    }
    for(int d=0;d<g-h+1;d++){
        for(int e=0;e<h;e++){
            c[s[e+d]-'a']=c[s[e+d]-'a']+1;
        }
        for(int b=0;b<26;b++){
            if(a[b]!=c[b]){
                f=1;
            }
            c[b]=0;
        }
        if(f==0){
            returnNums[*returnSize] = d;
            *returnSize =*returnSize + 1;
        }
        f=0;
    }
    return returnNums;
}