< Summary

Information
Class: LeetCode.Algorithms.PascalsTriangle.PascalsTriangleDynamicProgramming
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\PascalsTriangle\PascalsTriangleDynamicProgramming.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 44
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
Generate(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\PascalsTriangle\PascalsTriangleDynamicProgramming.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.PascalsTriangle;
 13
 14/// <inheritdoc />
 15public class PascalsTriangleDynamicProgramming : IPascalsTriangle
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^2)
 19    ///     Space complexity - O(n^2)
 20    /// </summary>
 21    /// <param name="numRows"></param>
 22    /// <returns></returns>
 23    public IList<IList<int>> Generate(int numRows)
 224    {
 225        var result = new List<IList<int>> { new List<int> { 1 } };
 26
 1227        for (var i = 1; i < numRows; i++)
 428        {
 429            var row = new List<int> { 1 };
 30
 2031            for (var j = 1; j < i; j++)
 632            {
 633                var value = result[i - 1][j - 1] + result[i - 1][j];
 34
 635                row.Add(value);
 636            }
 37
 438            row.Add(1);
 439            result.Add(row);
 440        }
 41
 242        return result;
 243    }
 44}

Methods/Properties

Generate(System.Int32)