摘要: 动态规划 int minimumTotal (vector<vector<int>>& triangle) { for (int i = triangle.size() - 2; i >= 0; --i) for (int j = 0; j < i + 1; ++j) triangle[i][j] 阅读全文
posted @ 2016-09-05 10:29 牧马人夏峥 阅读(100) 评论(0) 推荐(0)