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

LintCode 110. 最小路径和 更多...

class  Solution
 

函数

 TEST (min_path_sum, case1)
 
 TEST (min_path_sum, case2)
 
 TEST (min_path_sum, case3)
 

详细描述

LintCode 110. 最小路径和

函数说明

◆ TEST() [1/3]

lintcode::min_path_sum::TEST ( min_path_sum  ,
case1   
)

在文件 lintcode_test.cpp92 行定义.

92 {
93 int input[3][3] = {{1, 3, 1}, {1, 5, 1}, {4, 2, 1}};
94 auto vec = vector<vector<int>>();
95 vec.resize(3);
96 for(int i = 0; i < 3; i++) {
97 const auto to_add = vector(begin(input[i]), end(input[i]));
98 vec[i] = to_add;
99 }
100 auto sol = Solution();
101 ASSERT_EQ(7, sol.minPathSum(vec));
102 }
int vec[100010]
Definition: pat.cpp:5095

引用了 pat::a::a7_2::vec.

◆ TEST() [2/3]

lintcode::min_path_sum::TEST ( min_path_sum  ,
case2   
)

在文件 lintcode_test.cpp104 行定义.

104 {
105 int input[1][3] = {{1, 3, 2}};
106 auto vec = vector<vector<int>>();
107 vec.resize(1);
108 for(int i = 0; i < 1; i++) {
109 const auto to_add = vector(begin(input[i]), end(input[i]));
110 vec[i] = to_add;
111 }
112 auto sol = Solution();
113 ASSERT_EQ(6, sol.minPathSum(vec));
114 }

引用了 pat::a::a7_2::vec.

◆ TEST() [3/3]

lintcode::min_path_sum::TEST ( min_path_sum  ,
case3   
)

在文件 lintcode_test.cpp116 行定义.

116 {
117 int input[8][8] = {{1, 4, 8, 6, 2, 2, 1, 7}, {4, 7, 3, 1, 4, 5, 5, 1}, {8, 8, 2, 1, 1, 8, 0, 1}, {8, 9, 2, 9, 8, 0, 8, 9}, {5, 7, 5, 7, 1, 8, 5, 5}, {7, 0, 9, 4, 5, 6, 5, 6}, {4, 9, 9, 7, 9, 1, 9, 0}};
118 auto vec = vector<vector<int>>();
119 vec.resize(8);
120 for(int i = 0; i < 8; i++) {
121 const auto to_add = vector(begin(input[i]), end(input[i]));
122 vec[i] = to_add;
123 }
124 auto sol = Solution();
125 ASSERT_EQ(37, sol.minPathSum(vec));
126 }

引用了 pat::a::a7_2::vec.