ðŸŽ‰ Exercism Research is now launched. Help Exercism, help science and have some fun at research.exercism.io ðŸŽ‰

Published at Feb 21 2020
·
0 comments

Instructions

Test suite

Solution

Compute Pascal's triangle up to a given number of rows.

In Pascal's Triangle each number is computed by adding the numbers to the right and left of the current position in the previous row.

```
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
# ... etc
```

To run the tests, run the command `dotnet test`

from within the exercise directory.

Initially, only the first test will be enabled. This is to encourage you to solve the exercise one step at a time.
Once you get the first test passing, remove the `Skip`

property from the next test and work on getting that test passing.
Once none of the tests are skipped and they are all passing, you can submit your solution
using `exercism submit PascalsTriangle.cs`

For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io C# language page.

Pascal's Triangle at Wolfram Math World http://mathworld.wolfram.com/PascalsTriangle.html

```
// This file was auto-generated based on version 1.5.0 of the canonical data.
using Xunit;
public class PascalsTriangleTest
{
[Fact]
public void Zero_rows()
{
Assert.Empty(PascalsTriangle.Calculate(0));
}
[Fact(Skip = "Remove to run test")]
public void Single_row()
{
var expected = new[]
{
new[] { 1 }
};
Assert.Equal(expected, PascalsTriangle.Calculate(1));
}
[Fact(Skip = "Remove to run test")]
public void Two_rows()
{
var expected = new[]
{
new[] { 1 },
new[] { 1, 1 }
};
Assert.Equal(expected, PascalsTriangle.Calculate(2));
}
[Fact(Skip = "Remove to run test")]
public void Three_rows()
{
var expected = new[]
{
new[] { 1 },
new[] { 1, 1 },
new[] { 1, 2, 1 }
};
Assert.Equal(expected, PascalsTriangle.Calculate(3));
}
[Fact(Skip = "Remove to run test")]
public void Four_rows()
{
var expected = new[]
{
new[] { 1 },
new[] { 1, 1 },
new[] { 1, 2, 1 },
new[] { 1, 3, 3, 1 }
};
Assert.Equal(expected, PascalsTriangle.Calculate(4));
}
[Fact(Skip = "Remove to run test")]
public void Five_rows()
{
var expected = new[]
{
new[] { 1 },
new[] { 1, 1 },
new[] { 1, 2, 1 },
new[] { 1, 3, 3, 1 },
new[] { 1, 4, 6, 4, 1 }
};
Assert.Equal(expected, PascalsTriangle.Calculate(5));
}
[Fact(Skip = "Remove to run test")]
public void Six_rows()
{
var expected = new[]
{
new[] { 1 },
new[] { 1, 1 },
new[] { 1, 2, 1 },
new[] { 1, 3, 3, 1 },
new[] { 1, 4, 6, 4, 1 },
new[] { 1, 5, 10, 10, 5, 1 }
};
Assert.Equal(expected, PascalsTriangle.Calculate(6));
}
[Fact(Skip = "Remove to run test")]
public void Ten_rows()
{
var expected = new[]
{
new[] { 1 },
new[] { 1, 1 },
new[] { 1, 2, 1 },
new[] { 1, 3, 3, 1 },
new[] { 1, 4, 6, 4, 1 },
new[] { 1, 5, 10, 10, 5, 1 },
new[] { 1, 6, 15, 20, 15, 6, 1 },
new[] { 1, 7, 21, 35, 35, 21, 7, 1 },
new[] { 1, 8, 28, 56, 70, 56, 28, 8, 1 },
new[] { 1, 9, 36, 84, 126, 126, 84, 36, 9, 1 }
};
Assert.Equal(expected, PascalsTriangle.Calculate(10));
}
}
```

```
ï»¿using System.Collections.Generic;
public static class PascalsTriangle
{
public static IEnumerable<IEnumerable<int>> Calculate(int rows)
/*
* Return a list of the rows of a Pascal's Triangle
*/
{
List<List<int>> pascal = new List<List<int>>(); //List of list of rows
for (int row=0; row<rows; row++)
{
List<int> level = new List<int>(); //List for a row
level.Add(1); //Left-most (first) digit is a 1
for (int n = 0; n < row - 1; n++)
level.Add(pascal[row - 1][n] + pascal[row - 1][n + 1]);
if (row > 0)
level.Add(1); //Right-most (last) digit is a 1
pascal.Add(level);
}
return pascal;
}
}
```

A huge amount can be learned from reading other peopleâ€™s code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

- What compromises have been made?
- Are there new concepts here that you could read more about to improve your understanding?

Level up your programming skills with 3,423 exercises across 52 languages, and insightful discussion with our volunteer team of welcoming mentors.
Exercism is
**100% free forever**.

## Community comments