[leetcode]Triangle @ Python

原題位址：https://oj.leetcode.com/problems/triangle/

題意：

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

The minimum path sum from top to bottom

is <code>11</code> (i.e., 2 + 3 + 5 + 1 = 11).

Note:

Bonus point if you are able to do this using

only O(n) extra space, where n is the

total number of rows in the triangle.

解題思路：使用動态規劃（dp）。需要注意的是從後往前更新！

代碼：