120. Triangle(Array; 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 fo 阅读全文
posted @ 2015-10-27 20:10 joannae 阅读(223) 评论(0) 推荐(0) 编辑
