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

Maximum Path Sum in a Triangle

Find the largest sum on a path from the top of a number triangle to its bottom row.

Ce que vous allez apprendre

  • Replace exponential search with dynamic programming
  • Combine results from the row below
  • Handle negative values and empty input

Problème

Afficher la traduction

A number triangle has one value on row 0, two on row 1, and so on. Start at the top and move down one row at a time, each time to the value directly below or the one below and to the right (from position i to i or i + 1). Find the path whose values add up to the most. Trying every path doubles the work each row; working upward from the bottom row keeps it quadratic.

Implement triangle_max_path_sum(triangle).

Input

triangle: The rows from top to bottom; row r has r + 1 values, which may be negative.

Output

Return the largest possible sum of a top-to-bottom path. An empty triangle returns 0.

Contraintes

0 ≤ rows ≤ 100; −1000 ≤ value ≤ 1000

Exemples

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

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

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

Sortie attendue :
long expected = 28;

Explication

The best path is 4, 7, 9, 8 (position 0, 0, 1, 2), for 28.

Exemple 2
Entrée :
triangle = [
    [-3],
    [5, -8],
    [-1, 2, 9]
]

Sortie attendue :
expected = 4
Entrée :
std::vector<std::vector<long long>> triangle = {
    {-3},
    {5, -8},
    {-1, 2, 9}
};

Sortie attendue :
long long expected = 4;
Entrée :
long[][] triangle = new long[][] {
    new long[] {-3},
    new long[] {5, -8},
    new long[] {-1, 2, 9}
};

Sortie attendue :
long expected = 4;

Explication

With negatives, −3, 5, 2 gives 4 while −3, −8, 9 gives −2, so the answer is 4.

Comment l'aborder

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

Indice 1

Start from the bottom row: the best path from a bottom cell is just its value.

Indice 2

The best path from a cell is its value plus the larger best of the two cells below it.

Indice 3

After processing every row upward, the top cell holds the answer.

Complexité attendue

O(rows²) time, O(rows) 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.