leetcode-31. 下一个排列-C语言

int cmp(int *a, int *b) { return *a - *b; } int find(int *arr, int len, int index) { int i = index + 1, min = INT_MAX, ret = -1; while(i<len) { if(arr[i] > arr[index] && arr[i] <

>>阅读原文<<