numtower.java

这是本人自己写的关于数字宝塔的代码,希望对大家有所帮助

import java.util.Scanner;

public class NumTower {

	static int[]path;
	
	static int f(int[][]num, int row,int col,int sum){//返回
//		path[row]=col;
		if(row==num.length-1)
			if(sum==num[row][col]){
				/*for(int i=0;i<num.length;i++){
					System.out.print(num[i][path[i]]+" ");
				}
				System.out.println();*/
				return 1;				
			}
			else
				return 0;
		else
			return f(num,row+1,col,sum-num[row][col])
					+f(num,row+1,col+1,sum-num[row][col]);
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		while (scan.hasNext()) {
			int n = scan.nextInt();
//			path=new int[n];
			int[][] num=new int[n][];
			
			for(int i=0;i<num.length;i++)
				num[i]=new int[i+1];
			
			for(int i=0;i<num.length;i++)
				for(int j=0;j<num[i].length;j++)
					num[i][j]=scan.nextInt();
			
			int result=f(num,0,0,60);
			
			System.out.println(result);
		}
	}

}