Leetcode1078. Bigram 分词

给出第一个词 first 和第二个词 second，考虑在某些文本 text 中可能以 "first second third" 形式出现的情况，其中 second 紧随 first 出现，third 紧随 second 出现。

对于每种这样的情况，将第三个词 "third" 添加到答案中，并返回答案。

示例 1：

输入：text = "alice is a good girl she is a good student", first = "a", second = "good"
输出：["girl","student"]
示例 2：

输入：text = "we will we will rock you", first = "we", second = "will"
输出：["we","rock"]
 

提示：

1 <= text.length <= 1000
text 由小写英文字母和空格组成
text 中的所有单词之间都由 单个空格字符 分隔
1 <= first.length, second.length <= 10
first 和 second 由小写英文字母组成

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/occurrences-after-bigram
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

/**

 * Note: The returned array must be malloced, assume caller calls free().

 */

char ** findOcurrences(char * text, char * first, char * second,int*returnSize){

    char *p=first,*q=second,*t=text,*temp;

    char **a;

    int flag=0,i,count=0,c=0;

    a=(char**)malloc(sizeof(char*)*10);

    for(i=0;i<10;i++){

        a[i]=(char*)malloc(sizeof(char)*30);

    }

    while(*t!='\0'){

        if(!flag&&*t==*p){

            while(*++t==*++p){

                if(*t=='\0'){

                    c=1;

                    break;

                }

            }

            if(c)break;

            if(*p=='\0'){

                flag=1;

                p=first;

                t++;

                continue;

            }

            else p=first;

        }

        if(flag){ 

            if(*t!=*q){

                flag=0;

                continue;

            }

            temp=t;

            while(*++temp==*++q){

                if(*temp=='\0'&&*q=='\0')break;

            }

            if(*temp=='\0')break;

            if(*q=='\0'){

                temp++;

                i=0;

                while(*temp!=' '&&*temp!='\0'){

                    a[count][i]=*temp;

                    i++;

                    temp++;

                }

                a[count][i]='\0';

                count++;

                flag=0;

                p=first;

                q=second;

                continue;

            }

            else{

                q=second;

                flag=0;

            }

        }

        t++;

    }

    *returnSize=count;

    return a;

    }