径,使该路径所经过的数字的总和最大。
●每一步可沿左斜线向下或右斜线向下走;
●1<三角形行数≤100;
●三角形中的数字为整数0,1,…99;
.
(图3.1-1)
接下来描述整个三角形
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
import java.util.Scanner; public class Main { public static int n; public static int[][] map = new int[110][120]; public static int[][] sum = new int[110][120]; public static void main(String[] args) { // TODO Auto-generated method stub Scanner cin = new Scanner(System.in); n = cin.nextInt(); for(int i = 0; i < n; i++) { for(int j = 0; j <= i; j++) { map[i][j] = cin.nextInt(); // System.out.println(sum[i][j]); } } System.out.println(get(0,0)); } public static int get(int i, int j) { if(sum[i][j] != 0) { //判断之前是否访问过,避免重复搜索而超时 return sum[i][j]; } if(i == n - 1) { return sum[i][j] = map[i][j]; } return sum[i][j] = Math.max( get(i+1,j), get(i+1,j+1)) + map[i][j]; } }