< Summary

Information
Class: LeetCode.Algorithms.PascalsTriangle2.PascalsTriangle2DynamicProgramming
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\PascalsTriangle2\PascalsTriangle2DynamicProgramming.cs
Line coverage
100%
Covered lines: 12
Uncovered lines: 0
Coverable lines: 12
Total lines: 39
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
GetRow(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\PascalsTriangle2\PascalsTriangle2DynamicProgramming.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 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.PascalsTriangle2;
 13
 14/// <inheritdoc />
 15public class PascalsTriangle2DynamicProgramming : IPascalsTriangle2
 16{
 17    /// <summary>
 18    ///     Time complexity - O(rowIndex^2)
 19    ///     Space complexity - O(rowIndex)
 20    /// </summary>
 21    /// <param name="rowIndex"></param>
 22    /// <returns></returns>
 23    public IList<int> GetRow(int rowIndex)
 324    {
 325        var row = new List<int> { 1 };
 26
 1427        for (var i = 1; i <= rowIndex; i++)
 428        {
 1429            for (var j = i - 1; j >= 1; j--)
 330            {
 331                row[j] += row[j - 1];
 332            }
 33
 434            row.Add(1);
 435        }
 36
 337        return row;
 338    }
 39}

Methods/Properties

GetRow(System.Int32)