leetcode120. Triangle
2018-03-13 16:35
405 查看
class Solution {
public:
int minimumTotal(vector<vector<int>>& triangle) {
if(triangle.size()<=0) return 0;
int k = triangle.size() - 1;
vector<int> result(triangle[ k ].size(),0);
int temp1 = 0;
int temp2 = 0;
result[0] = triangle[0][0];
int cursor = 1;
while(cursor <=k){
temp1 = result[0];
temp2 = result[1];
result[0] = triangle[cursor][0] + temp1;
int i=1;
for(;i<triangle[cursor].size() - 1;i++){
result[i] = min(temp1,temp2)+triangle[cursor][i];
temp1 = temp2;
temp2 = result[i+1];
}
result[i] = temp1 + triangle[cursor][i];
cursor++;
}
int minval =result[0];
for(int j = 1;j<result.size();j++){
minval = min(minval,result[j]);
}
return minval;
}
};
public:
int minimumTotal(vector<vector<int>>& triangle) {
if(triangle.size()<=0) return 0;
int k = triangle.size() - 1;
vector<int> result(triangle[ k ].size(),0);
int temp1 = 0;
int temp2 = 0;
result[0] = triangle[0][0];
int cursor = 1;
while(cursor <=k){
temp1 = result[0];
temp2 = result[1];
result[0] = triangle[cursor][0] + temp1;
int i=1;
for(;i<triangle[cursor].size() - 1;i++){
result[i] = min(temp1,temp2)+triangle[cursor][i];
temp1 = temp2;
temp2 = result[i+1];
}
result[i] = temp1 + triangle[cursor][i];
cursor++;
}
int minval =result[0];
for(int j = 1;j<result.size();j++){
minval = min(minval,result[j]);
}
return minval;
}
};
相关文章推荐
- leetcode 120. Triangle
- LeetCode 120. Triangle (Python)最优解--Apolo_Shane
- LeetCode 120. Triangle (三角形)
- 【LeetCode】120. Triangle
- Leetcode 120. Triangle
- LeetCode解题报告 120. Triangle [medium]
- Leetcode 120. Triangle
- Leetcode 120. Triangle
- Leetcode 120. Triangle
- LeetCode 120. Triangle
- Leetcode-120. Triangle
- leetcode题解-120. Triangle
- [leetcode]120. Triangle
- leetcode 120. Triangle
- Leetcode-120. Triangle
- [leetcode]120. Triangle
- 第十四周:[leetCode] 120. Triangle
- LeetCode 120. Triangle
- LeetCode 120. Triangle 解题报告
- Leetcode 120. Triangle