HDU 5578 Friendship of Frog 暴力搜索

思路~ 暴力搜索  

         第一次开了个数组存值结果TLE，后来改了直接搜索过程直接得出最小值AC

//#include <bits/stdc++.h>#include <cstdio>#include <iostream>#include <cstring>#include <cstdlib>#include <stack>#include <queue>#include <algorithm>#include <cmath>#include <vector>using namespace std;typedef long long ll;int main(){    int t,k;    char a[1010];    int Min,count;    scanf("%d",&t);    count=0;    while (t--) {        scanf("%s",a);        k=0;        Min=9999;        for (int i=0; i<strlen(a); i++) {            for (int j=i+1; j<strlen(a); j++) {                if(a[i]==a[j]){                    Min=min(Min,j-i);                }            }        }        count++;        if(strlen(a)==1){            printf("Case #%d: -1\n",count);        }        else if(Min==9999){            printf("Case #%d: -1\n",count);        }        else            printf("Case #%d: %d\n",count,Min);    }    return 0;}