problemscpp
A collection of my answers to algorithm problems in c++.
载入中...
搜索中...
未找到
leetcode::increasing_triplet_subsequence 命名空间参考

LeetCode 334. 递增的三元子序列 更多...

class  Solution
 

函数

 TEST (increasing_triplet_subsequence, case1)
 
 TEST (increasing_triplet_subsequence, case2)
 
 TEST (increasing_triplet_subsequence, case3)
 
 TEST (increasing_triplet_subsequence, case4)
 

详细描述

LeetCode 334. 递增的三元子序列

函数说明

◆ TEST() [1/4]

leetcode::increasing_triplet_subsequence::TEST ( increasing_triplet_subsequence ,
case1  )

在文件 leetcode_test.cpp543 行定义.

543 {
544 int input[] = {1, 2, 3, 4, 5};
545 auto vec = vector(begin(input), end(input));
546 ASSERT_TRUE(Solution::increasingTriplet(vec));
547 }
static bool increasingTriplet(vector< int > &nums)

引用了 leetcode::increasing_triplet_subsequence::Solution::increasingTriplet().

◆ TEST() [2/4]

leetcode::increasing_triplet_subsequence::TEST ( increasing_triplet_subsequence ,
case2  )

在文件 leetcode_test.cpp549 行定义.

549 {
550 int input[] = {5, 4, 3, 2, 1};
551 auto vec = vector(begin(input), end(input));
552 ASSERT_FALSE(Solution::increasingTriplet(vec));
553 }

引用了 leetcode::increasing_triplet_subsequence::Solution::increasingTriplet().

◆ TEST() [3/4]

leetcode::increasing_triplet_subsequence::TEST ( increasing_triplet_subsequence ,
case3  )

在文件 leetcode_test.cpp555 行定义.

555 {
556 int input[] = {2, 1, 5, 0, 4, 6};
557 auto vec = vector(begin(input), end(input));
558 ASSERT_TRUE(Solution::increasingTriplet(vec));
559 }

引用了 leetcode::increasing_triplet_subsequence::Solution::increasingTriplet().

◆ TEST() [4/4]

leetcode::increasing_triplet_subsequence::TEST ( increasing_triplet_subsequence ,
case4  )

在文件 leetcode_test.cpp561 行定义.

561 {
562 int input[] = {20, 100, 10, 12, 5, 13};
563 auto vec = vector(begin(input), end(input));
564 ASSERT_TRUE(Solution::increasingTriplet(vec));
565 }

引用了 leetcode::increasing_triplet_subsequence::Solution::increasingTriplet().