这个题真的不是很简单,主要是很容易错,只有十分,我也没有写出来
考完和别人讨论,然后又写了写。
虽然写出来了但是写的思路很麻烦。
import java.util.Arrays;
public class 七段码 {
static int[] arr = {0,1,2,3,4,5,6};
public static void main(String[] args) {
// System.out.println(7+7+1+10+16+20+19);
int ans = 7;
ans += dfs(0,2)/2;
ans += dfs(0,3)/6;
ans += dfs(0,4)/24;
ans += dfs(0,5)/120;
ans += 7;
ans += 1;
System.out.println(ans);
}
//测出所以可能
private static int dfs(int index, int num) {
int count = 0;
if(index == num) {
if(check(num)) count ++;
}
for(int j = index;j<7;j++) {
{
int t = arr[j];
arr[j] = arr[index];
arr[index] = t;
}
count +=dfs(index +1,num);
{
int t = arr[j];
arr[j] = arr[index];
arr[index] = t;
}
}
return count;
}
//测试是否连通
private static boolean check(int num) {
int count = 0;
int[] check = new int[7];
for(int i = 0;i<num;i++) {
check[arr[i]] = 1;
}
for(int j = 0;j<7;j++) {
if(check[j] ==1) {
f(check,j);
count ++;
}
}
return count == 1;
}
private static void f(int[] check, int index) {
check[index] = 0;
if(index == 0) {
if(check[1] == 1) {
f(check,1);
}
if(check[5] == 1 ) {
f(check,5);
}
if(check[6] == 1) {
f(check,6);
}
}
if(index == 1) {
if(check[0] == 1) {
f(check,0);
}
if(check[2] == 1) {
f(check,2);
}
}
if(index == 2) {
if(check[1] == 1) {
f(check,1);
}
if(check[3] == 1 ) {
f(check,3);
}
if(check[6] == 1) {
f(check,6);
}
}
if(index == 3) {
if(check[2] == 1) {
f(check,2);
}
if(check[4] == 1 ) {
f(check,4);
}
if(check[6] == 1) {
f(check,6);
}
}
if(index == 4) {
if(check[3] == 1) {
f(check,3);
}
if(check[5] == 1 ) {
f(check,5);
}
}
if(index == 5) {
if(check[0] == 1) {
f(check,0);
}
if(check[4] == 1 ) {
f(check,4);
}
if(check[6] == 1) {
f(check,6);
}
}
if(index == 6) {
if(check[0] == 1) {
f(check,0);
}
if(check[2] == 1) {
f(check,2);
}
if(check[3] == 1) {
f(check,3);
}
if(check[5] == 1 ) {
f(check,5);
}
}
}
}