[LeetCode] 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

[
     [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).

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.

思考：自底向上的方法有点归并的感觉，总是将较小的和聚集到一个点。如果要求输出路径上的节点呢？如果底层的存储结果是树呢？

思维导图：

[LeetCode] Triangle 解题记录

原文：http://blog.csdn.net/vonzhoufz/article/details/40789889