【Java】计蒜客 蓝桥杯模拟赛5 组合数字

这是一道代码填空题

	static long test(int a[], int n) {
		long ret = 0;
		for (int i = 0; i < n; ++i) {
			int tp = a[i];
			int j = 1;
			while(tp != 0) {
				j *= 10;
				tp /= 10;
			}
			ret = ret * j + a[i];
		}
		return ret;
	}
	static long f(int a[], int k) {
		if (k == 6) {
			return test(a, k);
		}
		long ret = 0;
		for(int i = k; i < 6; ++i) {
			int t = a[k];
			a[k] = a[i];
			a[i] = t;
//f(a,k+1)是补全的代码
 ret = Math.max(ret,  f(a,k+1));
			t = a[k];
			a[k] = a[i];
			a[i] = t;
		}
		return ret;
	}
	public static void main(String[] args) {
		int[] a = {517, 283, 429, 65, 6566, 32};
		System.out.println(f(a, 0));
	}