码迷,mamicode.com
首页 > 编程语言 > 详细

Triangle Leetcode Python

时间:2015-01-19 09:18:45      阅读:286      评论:0      收藏:0      [点我收藏+]

标签:leetcode   python   dp   

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.


For example, given the following triangle
[
     [2],
    [3,4],
   [6,5,7],
  [4,1,8,3]

]


The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).

这道题目采用动态规划,从最底下往上依次相加得到解。

this is a DP problem, we can solve this problem by suming up from the bottom to the top.

class Solution:
    # @param triangle, a list of lists of integers
    # @return an integer
    def minimumTotal(self, triangle):
        rownum=len(triangle)
        for index in reversed(range(rownum)):
            if index==rownum-1:
                m=triangle[index]
            else:
                for j in range(index+1):
                    m[j]=triangle[index][j]+min(m[j],m[j+1])
        return m[0]


Triangle Leetcode Python

标签:leetcode   python   dp   

原文地址:http://blog.csdn.net/hyperbolechi/article/details/42863865

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!