给定一个N个数字(N不小于2且不大于10),这些数字取值范围为0到9且互不相同,且升序排列,将这些数字组成两组数,使得这两组数的绝对差最小。注:这两组数字均不能以0开头。
不用傻乎乎的去搜索,因为差值最小数的长度的一定是2/len和len-2/len,所以可以直接求全排列,然后取前半段和后半段
1.忘记0 9 的情况,输出了一个INF,wa了一次
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>
#include <stdlib.h>
#include <stdio.h>
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define l(x) x<<1
#define r(x) x<<1|1
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;
int t,len, k,demo[20],ans,a,b;
int get(int be, int en) {
int temp = 0;
for (int i = be; i < en; i++) temp = temp * 10 + demo[i];
return temp;
}
int main() {
ios::sync_with_stdio(false);
cin >> t;
while (t--) {
ans = INF;
len = 0;
do {
cin >> demo[len++];
} while (cin.get() != '\n');
k = len / 2;
if (len == 2) {
cout << abs(demo[0] - demo[1]) << endl;
continue;
}
while (next_permutation(demo, demo + len)) {
if (demo[0] == 0 || demo[k] == 0)
continue;
a = get(0, k);
b = get(k, len);
ans = min(ans, abs(a - b));
}
cout << ans << endl;
}
return 0;
}