杨辉三角

public class YanghuiDelta { public static void main(String[] args) { if(args.length<=0){ PrintHelp(); return; } if(args[0].equals("-n")) PrintYanghuiDelta(args[1]); else if(args[0].equals("-help")) PrintHelp(); else{ System.out.println("The command cannot be compiled!"); PrintHelp(); } } private static void PrintHelp() { System.out.println("YanhuiDelat -n num num is the count number of Yanghui"); System.out.println("YanhuiDelat -help display the help info"); } private static void BuildLevel(int level, int[] delta) { int cur,pre; if(level == 0){ } else{ cur = level-1; pre = cur - 1; delta[level] = delta[cur]; for(;pre>=0;pre--,cur--) { delta[cur]=delta[cur]+delta[pre]; } } } private static void PrintLevel(int level, int[] delta){ int ix=0; for(ix=0;ix<=level;ix++) { System.out.print(delta[ix]); System.out.print(" "); } System.out.println(); } private static void PrintYanghuiDelta(String string) { int n = Integer.parseInt(string); if(n<=0){ System.out.println("Error"); return; } int[] delta = new int[n]; delta[0]=1; int level=0; for(level=0;level<n;level++){ BuildLevel(level, delta); PrintLevel(level, delta); } } }