题目
链接:leetcode 30
给定一个字符串 s 和一些长度相同的单词 words。找出 s 中恰好可以由 words 中所有单词串联形成的子串的起始位置。
注意子串要与 words 中的单词完全匹配,中间不能有其他字符,但不需要考虑 words 中单词串联的顺序。
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* findSubstring(char * s, char ** words, int wordsSize, int* returnSize){
*returnSize = 0;
if (wordsSize == 0) return 0;
int wordslen = strlen(words[0]);
int len = wordsSize * wordslen;
int s_len = strlen(s);
if (s_len < len) return 0;
char temp[wordslen + 1];
int *local = (int *)malloc(sizeof(int) * s_len);
int flag[wordsSize];
int i = 0, j, res, k;
//确保滑动窗口的末位在s内
while (i + len <= s_len) {
//flag[]标记已被访问的单词
for (int m = 0; m < wordsSize; m++) flag[m] = 0;
for (j = i; j < i + len; j += wordslen) {
strncpy(temp, s + j, wordslen);
temp[wordslen] = '\0'; //注意
res = 0; //标记该单词在words中是否被查到
for (k = 0; k < wordsSize; k++) {
if (flag[k] == 1) continue;
if (strcmp(temp, words[k]) == 0) {
flag[k] = 1;
res = 1;
break;
}
}
if (res == 0) break;
}
if (res == 1) {
local[(*returnSize)++] = i;
}
i++;
}
return local;
}