numbercal.java

来自「数字游戏_Java版,一个用java写的数字游戏」· Java 代码 · 共 80 行

package com.john.cal;

public class NumberCal
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
//		int [][] n = new int[10][10];	//使用下标为：1-9
		//初始化数据
		int [][]n={	{0,0,0,0,0,0,0,0,0,0},
					{0,0,7,0,0,1,0,0,5,0},
					{0,2,0,0,0,7,0,0,0,4},
					{0,0,0,1,3,0,9,2,0,0},
					{0,0,0,3,9,0,2,6,0,0},
					{0,6,2,0,0,0,0,0,1,9},
					{0,0,0,4,1,0,5,8,0,0},
					{0,0,0,7,4,0,8,3,0,0},
					{0,3,0,0,0,2,0,0,0,6},
					{0,0,1,0,0,5,0,0,4,0}};
		int [][] a = {{2,3},{3}};
		//开始计算
		for (int i = 1; i < 10; i++)
		{
			for (int x = 1; x < 10; x++)
			{
				if(!isRowHasNum(n,x,i))
					System.out.print("["+x+"],");
			}
			System.out.println("行没有"+i+"!");
			for (int y = 1; y < 10; y++)
			{
				if(!isLineHasNum(n,y,i))
					System.out.print("["+y+"],");
			}
			System.out.println("列没有"+i+"!");
		}
	}
	
	public static int [] blockHasNum(int [][] n, int num)
	{
		int []numRecode = new int[10]; 
		for (int i = 1; i < 10; i++)
		{
			for (int j = 1; j < 4; j++)
			{
				for (int k = 1; k < 4; k++)
				{
					if(n[i*j][k]==num)
						numRecode[i]=1;
				}
			}
		}
		return null;
	}
	
	public static boolean isLineHasNum(int [][] n, int line, int num)//列
	{
		for (int i = 1; i < 10; i++)
		{
			if(n[i][line]==num)
				return true;
		}
		return false;
	}

	public static boolean isRowHasNum(int [][] n, int row, int num)//行
	{
		for (int i = 1; i < 10; i++)
		{
			if(n[row][i]==num)
				return true;
		}
		return false;
	}
}