Tous les défis
Moyen 0 résolus 0 % de réussite

Largest Product in a Grid

Find the largest product of k numbers in a straight line in a grid.

Ce que vous allez apprendre

  • Walk a grid in four directions with step pairs
  • Check bounds before reading a run
  • Track a running maximum

Problème

Afficher la traduction

A run is k cells in a straight line: left to right along a row, top to bottom down a column, or along either diagonal. Multiply the numbers in a run and find the run with the largest product.

Implement largest_product_in_grid(grid, k).

Input

grid: A rectangular grid of numbers; every row has the same length.

k: The length of a run.

Output

Return the largest product over all runs of length k. If no run of length k fits in the grid in any direction, return 0.

Contraintes

1 ≤ rows, columns ≤ 20; 0 ≤ grid[r][c] ≤ 99; 1 ≤ k ≤ 5

Exemples

Exemple 1
Entrée :
grid = [
    [1, 2, 3],
    [4, 5, 6],
    [7, 8, 9]
]
k = 2

Sortie attendue :
expected = 72
Entrée :
std::vector<std::vector<long long>> grid = {
    {1, 2, 3},
    {4, 5, 6},
    {7, 8, 9}
};
long long k = 2;

Sortie attendue :
long long expected = 72;
Entrée :
long[][] grid = new long[][] {
    new long[] {1, 2, 3},
    new long[] {4, 5, 6},
    new long[] {7, 8, 9}
};
long k = 2;

Sortie attendue :
long expected = 72;

Explication

The best run is 8 and 9 on the bottom row: 8 × 9 = 72. The diagonal 5, 9 only gives 45.

Exemple 2
Entrée :
grid = [
    [1, 2, 3],
    [4, 5, 6],
    [7, 8, 9]
]
k = 3

Sortie attendue :
expected = 504
Entrée :
std::vector<std::vector<long long>> grid = {
    {1, 2, 3},
    {4, 5, 6},
    {7, 8, 9}
};
long long k = 3;

Sortie attendue :
long long expected = 504;
Entrée :
long[][] grid = new long[][] {
    new long[] {1, 2, 3},
    new long[] {4, 5, 6},
    new long[] {7, 8, 9}
};
long k = 3;

Sortie attendue :
long expected = 504;

Explication

The bottom row gives 7 × 8 × 9 = 504, larger than the right column 3 × 6 × 9 = 162 or any diagonal.

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

Four directions are enough: right, down, down-right and down-left. The others repeat the same runs backwards.

Indice 2

From each start cell, check that the last cell of the run is still inside the grid.

Indice 3

Return 0 only when no run of length k fits at all.

Complexité attendue

O(rows × cols × k) time, O(1) extra space

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.