一维:
排序后过一遍后-前即可
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int a[5] = {2,3,1,4,5};
sort(a, a+5);
int minValue = a[1] - a[0];
for (int i = 2; i < 5; ++i) {
int temp = a[i] - a[i-1];
minValue = min(minValue, temp);
}
cout << minValue << endl;
return 0;
}
二维: