Lintcode 109 digital triangle, lintcode109

Source: Internet
Author: User
Tags lintcode

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];    }    };

  

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.