动态规划—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 th 阅读全文
posted @ 2017-08-31 15:45 一个不会coding的girl 阅读(168) 评论(0) 推荐(0) 编辑
