-
Notifications
You must be signed in to change notification settings - Fork 0
/
PyramidTests.cs
171 lines (143 loc) · 4.15 KB
/
PyramidTests.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
using System.IO;
using FluentAssertions;
using Xunit;
namespace MDPyramid
{
public class PyramidTests
{
[Fact]
public void Should_Find_Leftmost_Path()
{
var input = new[]
{
"1",
"8 9",
"11 5 9",
"4 5 2 3"
};
var pyramid = new Pyramid(input);
var result = pyramid.FindPath();
result.Nodes.Should().BeEquivalentTo(new[] { 1, 8, 11, 4 });
}
[Fact]
public void Should_Find_Rightmost_Path()
{
var input = new[]
{
"1",
"8 10",
"9 5 11",
"14 5 2 12"
};
var pyramid = new Pyramid(input);
var result = pyramid.FindPath();
result.Nodes.Should().BeEquivalentTo(new[] { 1, 10, 11, 12 });
}
[Fact]
public void Should_Find_Path_With_Negative_Values()
{
var input = new[]
{
"-1",
"-8 9",
"5 -9 9",
"1 -10 11 3",
"1 21 19 3 5"
};
var pyramid = new Pyramid(input);
var result = pyramid.FindPath();
result.Nodes.Should().BeEquivalentTo(new[] { -1, -8, 5, -10, 21 });
}
[Fact]
public void Should_Find_Path_When_Root_Node_Has_Multiple_Values()
{
var input = new[]
{
"51 4 21",
"1 10 11 3",
"1 21 19 3 5"
};
var pyramid = new Pyramid(input);
var result = pyramid.FindPath();
result.Nodes.Should().BeEquivalentTo(new[] { 51, 10, 21 });
}
[Fact]
public void Should_Find_Path_With_Single_Parent_Node()
{
var input = new[]
{
"1 4 21"
};
var pyramid = new Pyramid(input);
var result = pyramid.FindPath();
result.Nodes.Should().BeEquivalentTo(new[] { 1 });
}
[Fact]
public void Should_Find_Path_When_Comparing_Even_Numbers()
{
var input = new[]
{
"1",
"8 10",
"9 5 3",
"14 10 2 12"
};
var pyramid = new Pyramid(input);
var result = pyramid.FindPath();
result.Nodes.Should().BeEquivalentTo(new[] { 1, 8, 9, 14 });
}
[Fact]
public void Should_Find_Path_When_Comparing_Odd_Numbers()
{
var input = new[]
{
"1",
"8 10",
"9 5 3",
"14 10 2 12",
"1 7 3 4 5"
};
var pyramid = new Pyramid(input);
var result = pyramid.FindPath();
result.Nodes.Should().BeEquivalentTo(new[] { 1, 8, 9, 14, 7 });
}
[Fact]
public void Should_Find_Path_When_Comparing_Odd_And_Even_Numbers()
{
var input = new[]
{
"1",
"8 10",
"9 5 3",
"14 11 2 12",
"1 6 3 4 5"
};
var pyramid = new Pyramid(input);
var result = pyramid.FindPath();
result.Nodes.Should().BeEquivalentTo(new[] { 1, 8, 9, 14, 1 });
}
[Fact]
public void Should_Find_Path_For_SampleData1()
{
var r = new Pyramid(File.ReadAllLines(@".\sampleData1.txt")).FindPath();
r.Sum.Should().Be(16);
}
[Fact]
public void Should_Find_Path_For_SampleData2()
{
var r = new Pyramid(File.ReadAllLines(@".\sampleData2.txt")).FindPath();
r.Sum.Should().Be(8186);
}
[Fact]
public void Should_Find_Path_For_SampleData3()
{
var r = new Pyramid(File.ReadAllLines(@".\sampleData3.txt")).FindPath();
r.Sum.Should().Be(26);
}
[Fact]
public void Main_Should_Not_Throw()
{
Program.Main();
}
}
}