矩阵查询可获得的最大分数

// Java Stream solution
// Idea: Java Stream API is not well-suited for this problem since it involves DFS traversal with state tracking.
// However, we can use Stream to initialize the result array and then fill it using traditional loops.

import java.util.*;
import java.util.stream.IntStream;

public class Solution {
    public int[] maxScores(int[][] grid, int[] queries) {
        int m = grid.length;
        int n = grid[0].length;
        int[] answer = IntStream.of(queries).map(q -> dfs(grid, q, m, n)).toArray();
        return answer;
    }

    private int dfs(int[][] grid, int query, int m, int n) {
        boolean[][] visited = new boolean[m][n];
        return dfsHelper(grid, query, 0, 0, visited);
    }

    private int dfsHelper(int[][] grid, int query, int x, int y, boolean[][] visited) {
        if (x < 0 || x >= grid.length || y < 0 || y >= grid[0].length || visited[x][y] || grid[x][y] >= query) {
            return 0;
        }

        visited[x][y] = true;
        int score = 1;

        int[][] directions = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
        for (int[] dir : directions) {
            score += dfsHelper(grid, query, x + dir[0], y + dir[1], visited);
        }

        return score;
    }
}