题目描述:
题解:
首先排个序,最小的差值一定是相邻的,然后记录下最小的即可。
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <deque>
#include <list>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <iterator>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double E = exp(1.0);
const int MOD = 1e9+7;
const int MAX = 1e3+5;
int n;
int a[MAX];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
while(cin >> n)
{
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a,a+n);
int min_minus = inf;
for(int i = 1; i < n; i++)
{
if(abs((a[i] - a[i-1])) < min_minus)
{
min_minus = abs((a[i] - a[i-1]));
}
}
cout << min_minus << endl;
}
return 0;
}