Lintcode 109 digital triangle, lintcode109
Digital triangle
- Description
- Notes
- Data
- Evaluation
Given a digital triangle, find the minimum path and from top to bottom. Each step can be moved to an adjacent number in the following row.
Notes
If you only use extra space complexity O (n), you can get extra points, where n is the total number of rows in a digital triangle.
Have you ever encountered this question during a real interview? Yes, which company asked you this question? LinkedIn Amazon Airbnb Cryptic Studios Dropbox Epic Systems TinyCo Hedvig Uber Yelp Apple Yahoo Bloomberg Zenefits Twitter Microsoft Google Snapchat Facebook
Thank you for your feedback.
Example
For example, the following digital triangle is given:
[ [2], [3,4], [6,5,7], [4,1,8,3]]
The minimum path from top to bottom is 11 (2 + 3 + 5 + 1 = 11 ).
TagDynamic Planning
Related Questions
class Solution {public: /* * @param triangle: a list of lists of integers * @return: An integer, minimum path sum */ int minimumTotal(vector<vector<int>> &triangle) { // write your code here int x=triangle.size(); int y=triangle[x-1].size(); for(int i=x-2;i>=0;i--){ for(int j=0;j<=i;j++){ triangle[i][j]=min(triangle[i+1][j],triangle[i+1][j+1])+triangle[i][j]; } } return triangle[0][0]; } };