/**
* 算法思想:暴力法
*/
int cmp(char *s1, char *s2) {
int i = 0;
while(s1[i] && s2[i] && s1[i] == s2[i]) {
i++;
}
return s1[i] - s2[i];
}
#define LEN 0xfffff
char ** findRestaurant(char ** list1, int list1Size, char ** list2, int list2Size, int* returnSize){
int i, j, min = INT_MAX;
char **ret = (char **)malloc(sizeof(char *) * LEN);
int index = 0;
for(i=0; i<list1Size; i++){
for(j=0; j<list2Size; j++){
if(i+j <=min && cmp(list1[i], list2[j]) == 0) {
if(i+j <= min) {
min = i+j;
if(i+j < min)
index = 0;
ret[index++] = list1[i];
}
}
}
}
*returnSize = index;
return ret;
}
leecode-两个列表的最小索引总和-C语言
最新推荐文章于 2022-04-09 18:57:07 发布