leetcode::minimum_index_sum_of_two_lists 命名空间参考

LeetCode 599. Minimum Index Sum of Two Lists 更多...

类
class	Solution

函数
	TEST (minimum_index_sum_of_two_lists, case1)
	TEST (minimum_index_sum_of_two_lists, case2)

详细描述

LeetCode 599. Minimum Index Sum of Two Lists

函数说明

TEST() [1/2]

leetcode::minimum_index_sum_of_two_lists::TEST	(	minimum_index_sum_of_two_lists	,
		case1
	)

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

                                                    {
            vector<string> list1        = {"Shogun", "Tapioca Express", "Burger King", "KFC"};
            vector<string> list2        = {"Piatti", "The Grill at Torrey Pines", "Hungry Hunter Steakhouse", "Shogun"};
            const vector<string> output = {"Shogun"};
            ASSERT_EQ(output, Solution::findRestaurant(list1, list2));
        }

引用了 leetcode::minimum_index_sum_of_two_lists::Solution::findRestaurant().

TEST() [2/2]

leetcode::minimum_index_sum_of_two_lists::TEST	(	minimum_index_sum_of_two_lists	,
		case2
	)

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

                                                    {
            vector<string> list1        = {"Shogun", "Tapioca Express", "Burger King", "KFC"};
            vector<string> list2        = {"KFC", "Shogun", "Burger King"};
            const vector<string> output = {"Shogun"};
            ASSERT_EQ(output, Solution::findRestaurant(list1, list2));
        }

引用了 leetcode::minimum_index_sum_of_two_lists::Solution::findRestaurant().