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. Note: Bonus point if you are able to do this using only O(n) extra sp

>>阅读原文<<