java 九宫格数组

java 九宫格数组

package test;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class Test3$3 {
static int count = 0;

public static void main(String[] args) {
// int int1=0,int2=0,int3=0,int4=0,int5=0,int6=0,int7=0,int8=0,int9=0;
int[] intX = new int[9];
for (int i = 0; i < 9; i++) {
intX[i] = 0;
}
int[] oan = new int[9];
for (int i = 0; i < 9; i++) {
oan[i] = i + 1;
}
// 每行的和
int temp = 0;
for (int i = 0; i < 9; i++) {
temp += oan[i];
}
count = temp / 3;
System.out.println(count);
//
List list = new ArrayList();
for (int i = 0; i < 9 - 2; i++) {
for (int j = i + 1; j < 9 - 1; j++) {
for (int k = j + 1; k < 9; k++) {
if (oan[i] + oan[j] + oan[k] == count) {
int[] inttemp = { oan[i], oan[j], oan[k] };
// list.add(inttemp.toString());
for (int h = 0; h < 3; h++) {
int inttemp1 = inttemp[h];
switch (inttemp1) {
case 1:
intX[0] += 1;
break;
case 2:
intX[1] += 1;
break;
case 3:
intX[2] += 1;
break;
case 4:
intX[3] += 1;
.../ k++) {
if (oan[i] + oan[j] + oan[k] == count) {
int[] inttemp = { oan[i];
break;
break;
break, oan[j].util;
/.List;

import java;
case 4; 9.ArrayList; i <排序
Arrays;
case 7;
for (int h = 0;
}
count = temp /
System;
}
/ h++) {
int inttemp1 = inttemp[h]; intX;
break;
reInt [1][1] = intX[8]:
break;
switch (inttemp1) {
case 1:
intX[7] += 1,int3=0; k <,int8=0; 9 - 2;

public static void main(String[] args) {
/.println(intX[i]);
}
/:
intX[2] += 1; i++) {
System; 9; 每行的和
int temp = 0package test;
case 6;
for (int i = 0;
break.util; j++) {
for (int k = j + 1; 3;
break.sort(intX);
/
}
}
}
}
}
}
/, oan[k] }; i++) {
intX[i] = 0.out; i <
break;
/.toString()); 9; j <
break;

public class Test3$3 {
static int count = 0:
intX[1] += 1;
case 3;
import java; 9 - 1;/.Arrays;
case 9;
for (int i = 0;
int[] intX = new int[9]; i <:
intX[8] += 1;
default; test
for (int i = 0.println(count); 3.length,int2=0;
int a = intX[7]; i++) {
for (int j = i + 1;
import java.util:
intX[3] += 1;
case 2;
break,int9=0;
case 8; list; i++) {
oan[i] = i + 1,int4=0;

int [][]reInt = new int[3][]; int int1=0; i <:
intX[5] += 1,int5=0;/,int6=0;
}
int[] oan = new int[9]:
intX[0] += 1;
for (int i = 0:
intX[4] += 1,int7=0.out; 9; i List list = new ArrayList();
case 5; i++) {
temp += oan[i];
for (int i = 0:
intX[6] += 1;/.add(inttemp

package test; import java.util.arraylist; import java.util.arrays; import java.util.list; public class test3$3 { static int count = 0; public static void main(string[] args) { // int int1=0,int2=0,int3=0,int4=0,int5=0,int6=0,int7=0,int8=0,int9=0; int[] intx = new int[9]; for (int i = 0; i < 9; i++) { intx[i] = 0; } int[] oan = new int[9]; for (int i = 0; i < 9; i++) { oan[i] = i + 1; } // 每行的和 int temp = 0; for (int i = 0; i < 9; i++) { temp += oan[i]; } count = temp / 3; system.out.println(count); // list list = new arraylist(); for (int i = 0; i < 9 - 2; i++) { for (int j = i + 1; j < 9 - 1; j++) { for (int k = j + 1; k < 9; k++) { if (oan[i] + oan[j] + oan[k] == count) { int[] inttemp = { oan[i], oan[j], oan[k] }; // list.add(inttemp.tostring()); for (int h = 0; h < 3; h++) { int inttemp1 = inttemp[h]; switch (inttemp1) { case 1: intx[0] += 1; break; case 2: intx[1] += 1; break; case 3: intx[2] += 1; break; case 4: intx[3] += 1; break; case 5: intx[4] += 1; break; case 6: intx[5] += 1; break; case 7: intx[6] += 1; break; case 8: intx[7] += 1; break; case 9: intx[8] += 1; break; default: break; } } } } } } //排序 arrays.sort(intx); // test for (int i = 0; i < intx.length; i++) { system.out.println(intx[i]); } // int a = intx[7];    int [][]reint = new int[3][]; reint [1][1] = intx[8]; } }