leetcode::minimum_size_subarray_sum 命名空间参考

1. Minimum Size Subarray Sum

更多...

类
class	Solution

函数
	TEST (minimum_size_subarray_sum, case1)
	TEST (minimum_size_subarray_sum, case2)
	TEST (minimum_size_subarray_sum, case3)
	TEST (minimum_size_subarray_sum, case4)
	TEST (minimum_size_subarray_sum, case5)

详细描述

1. Minimum Size Subarray Sum

函数说明

TEST() [1/5]

leetcode::minimum_size_subarray_sum::TEST	(	minimum_size_subarray_sum	,
		case1
	)

在文件 leetcode_test.cpp 第 2931 行定义.

                                               {
            vector nums      = {2, 3, 1, 2, 4, 3};
            const int target = 7;
            ASSERT_EQ(2, Solution::minSubArrayLen(target, nums));
        }

引用了 leetcode::minimum_size_subarray_sum::Solution::minSubArrayLen().

TEST() [2/5]

leetcode::minimum_size_subarray_sum::TEST	(	minimum_size_subarray_sum	,
		case2
	)

在文件 leetcode_test.cpp 第 2937 行定义.

                                               {
            vector nums      = {1, 4, 4};
            const int target = 4;
            ASSERT_EQ(1, Solution::minSubArrayLen(target, nums));
        }

引用了 leetcode::minimum_size_subarray_sum::Solution::minSubArrayLen().

TEST() [3/5]

leetcode::minimum_size_subarray_sum::TEST	(	minimum_size_subarray_sum	,
		case3
	)

在文件 leetcode_test.cpp 第 2943 行定义.

                                               {
            vector nums      = {1, 1, 1, 1, 1, 1, 1, 1};
            const int target = 11;
            ASSERT_EQ(0, Solution::minSubArrayLen(target, nums));
        }

引用了 leetcode::minimum_size_subarray_sum::Solution::minSubArrayLen().

TEST() [4/5]

leetcode::minimum_size_subarray_sum::TEST	(	minimum_size_subarray_sum	,
		case4
	)

在文件 leetcode_test.cpp 第 2949 行定义.

                                               {
            vector nums      = {5, 1, 3, 5, 10, 7, 4, 9, 2, 8};
            const int target = 15;
            ASSERT_EQ(2, Solution::minSubArrayLen(target, nums));
        }

引用了 leetcode::minimum_size_subarray_sum::Solution::minSubArrayLen().

TEST() [5/5]

leetcode::minimum_size_subarray_sum::TEST	(	minimum_size_subarray_sum	,
		case5
	)

在文件 leetcode_test.cpp 第 2955 行定义.

                                               {
            vector nums      = {10, 5, 13, 4, 8, 4, 5, 11, 14, 9, 16, 10, 20, 8};
            const int target = 80;
            ASSERT_EQ(6, Solution::minSubArrayLen(target, nums));
        }

引用了 leetcode::minimum_size_subarray_sum::Solution::minSubArrayLen().