Skip to content

Commit 042409d

Browse files
committed
format cpp
1 parent 5767837 commit 042409d

File tree

1 file changed

+5
-4
lines changed

1 file changed

+5
-4
lines changed

cpp/problem_0217/contains_duplicate.test.cpp

Lines changed: 5 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
#define CATCH_CONFIG_MAIN
2-
#include "../catch_amalgamated.hpp"
32
#include "contains_duplicate.cpp"
43

4+
#include "../catch_amalgamated.hpp"
5+
56
TEST_CASE("Contains Duplicate", "[contains_duplicate]") {
67
Solution solution;
78

@@ -124,7 +125,7 @@ TEST_CASE("Contains Duplicate", "[contains_duplicate]") {
124125

125126
// Large array with one duplicate at the end
126127
vector<int> large_with_dup = large_unique;
127-
large_with_dup.push_back(500); // Duplicate of existing element
128+
large_with_dup.push_back(500); // Duplicate of existing element
128129
REQUIRE(solution.containsDuplicate(large_with_dup) == true);
129130
}
130131

@@ -139,7 +140,7 @@ TEST_CASE("Contains Duplicate", "[contains_duplicate]") {
139140

140141
// Fibonacci-like sequence
141142
vector<int> nums3 = {1, 1, 2, 3, 5, 8, 13};
142-
REQUIRE(solution.containsDuplicate(nums3) == true); // Two 1's
143+
REQUIRE(solution.containsDuplicate(nums3) == true); // Two 1's
143144
}
144145

145146
SECTION("Multiple duplicates") {
@@ -192,4 +193,4 @@ TEST_CASE("Contains Duplicate", "[contains_duplicate]") {
192193
vector<int> unsorted_dup = {3, 1, 4, 1, 5, 9, 2};
193194
REQUIRE(solution.containsDuplicate(unsorted_dup) == true);
194195
}
195-
}
196+
}

0 commit comments

Comments
 (0)