题目来源于CCFCSP
思路分析
从小到达排序即可,然后相邻项,进行求差,并找出最小差值即可
代码解析
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n,num,difference = 0x0fffffff;
vector<int> value;
cin >> n;
while (n--) {
cin >> num;
value.push_back(num);
}
sort(value.begin(), value.end());
for (vector<int>::iterator it = value.begin();
it != value.end() - 1;++it) {
difference = min(difference, abs((*it) - *(it + 1)));
}
cout << difference << endl;
}
测试结果