< Summary

Information
Class: LeetCode.Algorithms.Triangle.TriangleDynamicProgramming
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\Triangle\TriangleDynamicProgramming.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 46
Line coverage: 100%
Branch coverage
100%
Covered branches: 6
Total branches: 6
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MinimumTotal(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\Triangle\TriangleDynamicProgramming.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.Triangle;
 13
 14/// <inheritdoc />
 15public sealed class TriangleDynamicProgramming : ITriangle
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^2)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="triangle"></param>
 22    /// <returns></returns>
 23    public int MinimumTotal(IList<IList<int>> triangle)
 224    {
 225        var rowsCount = triangle.Count;
 226        var cellsCount = rowsCount;
 27
 1028        for (var rowIndex = rowsCount - 1; rowIndex > 0; rowIndex--)
 329        {
 330            var row = triangle[rowIndex];
 331            var previousRow = triangle[rowIndex - 1];
 32
 1833            for (var cellIndex = 0; cellIndex < cellsCount - 1; cellIndex++)
 634            {
 635                var value = row[cellIndex];
 636                var nextValue = row[cellIndex + 1];
 37
 638                previousRow[cellIndex] += value < nextValue ? value : nextValue;
 639            }
 40
 341            cellsCount--;
 342        }
 43
 244        return triangle[0][0];
 245    }
 46}