JAVA算法题03:矩阵路径
题目描述:
给出了一个n*n的矩形,编程求从左上角到右下角的路径数(n > =2),限制只能向右或向下移动,不能回退。例如当n=2时,有6条路径。
分为寻路代码和两种计算计算路径总数(组合,赋值)的方法
完整代码
import java.text.MessageFormat;
public class ListTest {
public static void main(String[] args) {
// 创建n*n的矩阵数组
int n = 5;
int[][] a = new int[n][n];
int num = 0;
double f = Math.log10(n*n);
if (f-(int)f != 0){
f += 1;
}
System.out.println("a[" + n + "][" + n + "]:");
for (int i = 0; i < n; i++) {
System.out.print("[");
for (int j = 0; j < n; j++) {
a[i][j] = num;
System.out.printf(MessageFormat.format("%{0}d, ", (int)f), num);
num += 1;
}
System.out.println("\b\b]");
}
// 寻路
int i = 0;
int j = 0;
String load = "";
find(a, i, j, n, load);
System.out.println("预测路径数(组合计算):" + C(n-1,2*n-2));
System.out.println("预测路径数(模拟数组):" + array(n));
System.out.println("测试结果:" + loadNum);
}
// 方法执行次数(多少种路径)
public static int loadNum = 0;
// 寻路方法
public static void find(int[][] a, int i, int j, int n, String load){
if (i<n-1 && j<n-1){
// 向下分路
String load1 = load;
load1 += a[i][j] + " ";
find(a, i+1, j, n, load1);
// 向右分路
String load2 = load;
load2 += a[i][j] + " ";
find(a, i, j + 1, n, load2);
} else if (i<n-1 && j==n-1){
// 只有向下分路
load += a[i][j] + " ";
find(a, i+1, j, n, load);
} else if (i==n-1 && j<n-1){
// 只有向右分路
load += a[i][j] + " ";
find(a, i, j+1, n, load);
} else {
System.out.println(load + a[i][j]);
loadNum += 1;
}
}
// 计算C(a,b)组合数
public static int C(int a, int b){
double c = 1;
for (int i = a; i > 0; i--) {
c *= (double) b/i;
b -= 1;
}
return (int)c;
}
// 数组赋值模拟
public static int array(int n){
int[][] a = new int[n][n];
for (int i = 0; i < n; i++) {
a[0][i] = 1;
a[i][0] = 1;
}
for (int i = 1; i < n; i++) {
for (int j = 1; j < n; j++) {
a[i][j] = a[i-1][j] + a[i][j-1];
}
}
return a[n-1][n-1];
}
}