2016年1月11日
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],... 阅读全文
posted @ 2016-01-11 11:28 dylqt 阅读(209) 评论(0) 推荐(0)