#include <bits/stdc++.h>
using namespace std
;
int f(int a
[], int n
){
sort(a
, a
+ n
);
int dmin
= a
[1] - a
[0];
for(int i
= 2; i
< n
; i
++){
int temp
= a
[i
] - a
[i
-1];
if(temp
< dmin
){
dmin
= temp
;
}
}
return dmin
;
}
int main(){
int a
[] = {4, 3, 1, 2, 5};
int n
= sizeof(a
) / sizeof(a
[0]);
cout
<< "最小差值为:" << f(a
, n
);
return 0;
}
转载请注明原文地址: https://mac.8miu.com/read-490654.html