34 lines
867 B
C++
34 lines
867 B
C++
#include "s0034_find_first_and_last_position_of_element_in_sorted_array.hpp"
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
TEST(Problem34, Case1) {
|
|
vector<int> nums{5, 7, 7, 8, 8, 10};
|
|
int target{8};
|
|
vector<int> o{3, 4};
|
|
Solution1 solution1;
|
|
Solution2 solution2;
|
|
EXPECT_EQ(solution1.searchRange(nums, target), o);
|
|
EXPECT_EQ(solution2.searchRange(nums, target), o);
|
|
}
|
|
|
|
TEST(Problem34, Case2) {
|
|
vector<int> nums{5, 7, 7, 8, 8, 10};
|
|
int target{6};
|
|
vector<int> o{-1, -1};
|
|
Solution1 solution1;
|
|
Solution2 solution2;
|
|
EXPECT_EQ(solution1.searchRange(nums, target), o);
|
|
EXPECT_EQ(solution2.searchRange(nums, target), o);
|
|
}
|
|
|
|
TEST(Problem34, Case3) {
|
|
vector<int> nums{};
|
|
int target{0};
|
|
vector<int> o{-1, -1};
|
|
Solution1 solution1;
|
|
Solution2 solution2;
|
|
EXPECT_EQ(solution1.searchRange(nums, target), o);
|
|
EXPECT_EQ(solution2.searchRange(nums, target), o);
|
|
}
|