数塔问题=Java

最新推荐文章于 2023-11-27 15:49:10 发布

听分的诉说

最新推荐文章于 2023-11-27 15:49:10 发布

阅读量117

点赞数

分类专栏： Java 算法文章标签： java 开发语言

本文链接：https://blog.csdn.net/qq_63325854/article/details/130308147

版权

Java 同时被 2 个专栏收录

11 篇文章 0 订阅

订阅专栏

算法

4 篇文章 0 订阅

订阅专栏

源代码：

/**
 * @description: TODO
 * @author 48zj
 * @date 2023/4/22 16:42
 * @version 1.0
 */

import java.util.Scanner;

/**
 *@BelongsProject: javaSenior
 *@BelongsPackage: PACKAGE_NAME
 *@Author: 48-zj
 *@CreateTime: 2023-04-22  16:42
 *@Description: TODO
 *@Version: 1.0
 */
public class Shuta {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("请输入数塔层数");
        int n=scanner.nextInt() ;
        int d[][]=new int[n][n];
        for(int i=0;i<n;i++){
            for(int j=0;j<=i;j++){
                d[i][j]=scanner.nextInt();
            }
        }
        int a=DataRorwer(d,n);
        System.out.println("最长路径长度" + a);
    }
    public static int DataRorwer(int d[][],int n){
        int i,j;
        int maxAdd[][]=new int[n][n];
        int path [][]=new int[n][n];
        for( j=0;j<n;j++){
            maxAdd[n-1][j]=d[n-1][j];
        }
        for(i=n-2;i>=0;i--) {
            for ( j = 0; j <= i; j++) {
                if (maxAdd[i + 1][j] > maxAdd[i + 1][j + 1]) {
                    maxAdd[i][j] = maxAdd[i + 1][j] + d[i][j];
                    path[i][j] = j;
                } else {
                    maxAdd[i][j] = maxAdd[i + 1][j + 1] + d[i][j];
                    path[i][j] = j + 1;
                }
            }
        }
        System.out.print("路径为" + d[0][0]);
                j=path[0][0];
                for(i=1;i<n;i++){
                    System.out.print("--->" + d[i][j]);
                    j=path[i][j];
                }
                return maxAdd[0][0];
            }
        }

运行结果：

D:\develop-tools\Java\jdk1.8.0_331\bin\java.exe "-javaagent:D:\develop-tools\IDear\idearj\IntelliJ IDEA 2020.3.4\lib\idea_rt.jar=58386:D:\develop-tools\IDear\idearj\IntelliJ IDEA 2020.3.4\bin" -Dfile.encoding=UTF-8 -classpath D:\develop-tools\Java\jdk1.8.0_331\jre\lib\charsets.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\deploy.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\access-bridge-64.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\cldrdata.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\dnsns.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\jaccess.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\jfxrt.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\localedata.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\nashorn.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\sunec.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\sunjce_provider.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\sunmscapi.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\sunpkcs11.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\ext\zipfs.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\javaws.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\jce.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\jfr.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\jfxswt.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\jsse.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\management-agent.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\plugin.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\resources.jar;D:\develop-tools\Java\jdk1.8.0_331\jre\lib\rt.jar;D:\JAVA文件\Ideajavaworkspace\javaSenior\out\production\day02 Shuta
请输入数塔层数
5
59
50 49
38 34 29
21 28 19 21
19 7 10 4 6
路径为59--->50--->38--->21--->19最长路径长度187

Process finished with exit code 0

理解不了代码的可以看算法设计与分析第三版 p147