C++ 寻找字符串数组中最小的字符串

#include #include using namespace std;

void find(char *name[], int n, int *p) { int minIndex = 0; for (int i = 1; i < n; i++) { if (strcmp(name[i], name[minIndex]) < 0) { minIndex = i; } } *p = minIndex; }

int main() { const int MAX_SIZE = 100; char *names[MAX_SIZE]; int count = 0; char input[7]; while (true) { cin >> input; if (strcmp(input, '####') == 0) { break; } char *name = new char[strlen(input) + 1]; strcpy(name, input); names[count++] = name; } int minIndex; find(names, count, &minIndex); cout << names[minIndex] << endl; for (int i = 0; i < count; i++) { delete [] names[i]; } return 0; }