华为OD机考-寻找最大价值的矿堆-DFS（JAVA 2025B卷）

原创已于 2025-06-17 19:14:09 修改 · 215 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#华为od

于 2025-06-16 00:14:01 首次发布

华为机考专栏收录该内容

78 篇文章

订阅专栏

在这里插入图片描述

import java.util.*;
/**
 * @version Ver 1.0
 * @date 2025/6/17
 * @description 最大矿堆价值
 */
public class MaxStoneValue {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        List<String> list = new ArrayList<>();
        while (sc.hasNextLine()) {
            String line = sc.nextLine().trim();
            if (line.isEmpty()) break;
            list.add(line);
        }
        if (list.isEmpty()) {
            return;
        }
        int[][] grid = new int[list.size()][list.get(0).length()];
        for (int i = 0; i < grid.length; i++) {
            for(int j = 0; j < grid[0].length; j++){
                grid[i][j] = list.get(i).charAt(j)-'0';
            }
        }
        System.out.println(solve(grid));
    }

    private static int solve(int[][] grid) {
        int maxValue = 0;
        for (int i = 0; i < grid.length; i++) {
            for(int j = 0; j < grid[0].length; j++){
                if (grid[i][j] != 0) {
                    maxValue= Math.max(maxValue, dfs(grid,i,j));
                }
            }
        }
        return maxValue;
    }

    private static int dfs(int[][] grid, int i, int j) {
        int res = 0;
        if(i<0 ||i>=grid.length ||j<0||j>=grid[0].length||grid[i][j]==0){
            return res;
        }
        res+=grid[i][j];
        grid[i][j]=0;
        res+=dfs(grid,i+1,j);
        res+=dfs(grid,i-1,j);
        res+=dfs(grid,i,j+1);
        res+=dfs(grid,i,j-1);
        return res;
    }
}