forked from reingart/exercism
-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathsaddle_points_test.py
97 lines (81 loc) · 3.32 KB
/
saddle_points_test.py
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
# These tests are auto-generated with test data from:
# https://github.com/exercism/problem-specifications/tree/main/exercises/saddle-points/canonical-data.json
# File last updated on 2023-07-19
import unittest
from saddle_points import (
saddle_points,
)
def sorted_points(point_list):
return sorted(point_list, key=lambda p: (p["row"], p["column"]))
class SaddlePointsTest(unittest.TestCase):
def test_can_identify_single_saddle_point(self):
matrix = [[9, 8, 7], [5, 3, 2], [6, 6, 7]]
self.assertEqual(
sorted_points(saddle_points(matrix)),
sorted_points([{"row": 2, "column": 1}]),
)
def test_can_identify_that_empty_matrix_has_no_saddle_points(self):
matrix = []
self.assertEqual(sorted_points(saddle_points(matrix)), sorted_points([]))
def test_can_identify_lack_of_saddle_points_when_there_are_none(self):
matrix = [[1, 2, 3], [3, 1, 2], [2, 3, 1]]
self.assertEqual(sorted_points(saddle_points(matrix)), sorted_points([]))
def test_can_identify_multiple_saddle_points_in_a_column(self):
matrix = [[4, 5, 4], [3, 5, 5], [1, 5, 4]]
self.assertEqual(
sorted_points(saddle_points(matrix)),
sorted_points(
[
{"row": 1, "column": 2},
{"row": 2, "column": 2},
{"row": 3, "column": 2},
]
),
)
def test_can_identify_multiple_saddle_points_in_a_row(self):
matrix = [[6, 7, 8], [5, 5, 5], [7, 5, 6]]
self.assertEqual(
sorted_points(saddle_points(matrix)),
sorted_points(
[
{"row": 2, "column": 1},
{"row": 2, "column": 2},
{"row": 2, "column": 3},
]
),
)
def test_can_identify_saddle_point_in_bottom_right_corner(self):
matrix = [[8, 7, 9], [6, 7, 6], [3, 2, 5]]
self.assertEqual(
sorted_points(saddle_points(matrix)),
sorted_points([{"row": 3, "column": 3}]),
)
def test_can_identify_saddle_points_in_a_non_square_matrix(self):
matrix = [[3, 1, 3], [3, 2, 4]]
self.assertEqual(
sorted_points(saddle_points(matrix)),
sorted_points([{"row": 1, "column": 3}, {"row": 1, "column": 1}]),
)
def test_can_identify_that_saddle_points_in_a_single_column_matrix_are_those_with_the_minimum_value(
self,
):
matrix = [[2], [1], [4], [1]]
self.assertEqual(
sorted_points(saddle_points(matrix)),
sorted_points([{"row": 2, "column": 1}, {"row": 4, "column": 1}]),
)
def test_can_identify_that_saddle_points_in_a_single_row_matrix_are_those_with_the_maximum_value(
self,
):
matrix = [[2, 5, 3, 5]]
self.assertEqual(
sorted_points(saddle_points(matrix)),
sorted_points([{"row": 1, "column": 2}, {"row": 1, "column": 4}]),
)
# Additional tests for this track
def test_irregular_matrix(self):
matrix = [[3, 2, 1], [0, 1], [2, 1, 0]]
with self.assertRaises(ValueError) as err:
saddle_points(matrix)
self.assertEqual(type(err.exception), ValueError)
self.assertEqual(err.exception.args[0], "irregular matrix")