problemscpp
A collection of my answers to algorithm problems in c++.
| 函数
leetcode::contains_duplicate_ii 命名空间参考

LeetCode 219. 存在重复元素 II 更多...

class  Solution
 

函数

 TEST (contains_duplicate_ii, case1)
 
 TEST (contains_duplicate_ii, case2)
 
 TEST (contains_duplicate_ii, case3)
 

详细描述

LeetCode 219. 存在重复元素 II

函数说明

◆ TEST() [1/3]

leetcode::contains_duplicate_ii::TEST ( contains_duplicate_ii  ,
case1   
)

在文件 leetcode_test.cpp735 行定义.

735 {
736 int input[] = {1, 2, 3, 1};
737 auto vec = vector(begin(input), end(input));
738 ASSERT_TRUE(Solution::containsNearbyDuplicate(vec, 3));
739 }
int vec[100010]
Definition: pat.cpp:5095

引用了 leetcode::contains_duplicate_ii::Solution::containsNearbyDuplicate() , 以及 pat::a::a7_2::vec.

◆ TEST() [2/3]

leetcode::contains_duplicate_ii::TEST ( contains_duplicate_ii  ,
case2   
)

在文件 leetcode_test.cpp741 行定义.

741 {
742 int input[] = {1, 0, 1, 1};
743 auto vec = vector(begin(input), end(input));
744 ASSERT_TRUE(Solution::containsNearbyDuplicate(vec, 3));
745 }

引用了 leetcode::contains_duplicate_ii::Solution::containsNearbyDuplicate() , 以及 pat::a::a7_2::vec.

◆ TEST() [3/3]

leetcode::contains_duplicate_ii::TEST ( contains_duplicate_ii  ,
case3   
)

在文件 leetcode_test.cpp747 行定义.

747 {
748 int input[] = {1, 2, 3, 1, 2, 3};
749 auto vec = vector(begin(input), end(input));
750 ASSERT_FALSE(Solution::containsNearbyDuplicate(vec, 2));
751 }

引用了 leetcode::contains_duplicate_ii::Solution::containsNearbyDuplicate() , 以及 pat::a::a7_2::vec.