【動歸】B007_LC_三角形最小路徑和（遞歸 | 記憶化搜索 | 二維 dp | 一維 dp）

1、題目描述 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.html For example, given the following trianglejava [ [2], [3

>>阅读原文<<