递归实现杨辉三角
public class YangHui {
//杨辉三角
public static int YangHui(int i,int j){
//判断参数合法性
if (j<=i&&i>=0&&j>=0){
//递归终止条件
if (j==0||i==j){
//满足递归终止条件的解决办法
return 1;
}
//提取重复逻辑,递归调用
return YangHui(i-1,j-1)+YangHui(i-1,j);
//arr[i][j]=arr[i-1][j-1]+arr[i-1][j];
}
return -1;
}
public static void main(String[] args) {
System.out.println(YangHui(0,0));
System.out.println(YangHui(4,3));
}
}