Problem:
对于一个整数数列A[0], A[1], …, A[N-1],要求在其中找两个数,使得它们的差的绝对值最小.
2 <= N <= 100, -1000 <= A[i] <= 1000.
请实现下面Solution类中计算minDifference(A)的函数,返回值为能得到的最小差.
class Solution {
public:
int minDifference(vector<int> A) {}
};
例1:当A = {2, 7, -2}, 返回4.
例2:当A = {-8, 10, 30, 10}, 返回0.
Code:
class Solution {
public:
int minDifference(vector<int> A) {
int result = 9999;
for (int i = 0; i < A.size(); i++) {
for (int j = i+1; j < A.size(); j++) {
if (abs(A[i]-A[j]) < result)
result = abs(A[i] - A[j]);
}
}
return result;
}
};