摘要：
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], [4,1,8,3]]The minimum path sum from top to bottom is11(i.e.,2+3+5+1= 11).今天的最后一题Triangle是经典的动态规划问题，第i行... 阅读全文
摘要：
今天的练习题是triangle三件套：Triangle, PASCAL Triangle, PASCAL Triangle II.PASCAL Triangle就是小学奥数中的“杨辉三角”, 存在如下关系triangle[i+1][j+1] = triangle[i][j]+triangle[i][j+1]即第i+1行第j+1个元素为第i行第j个元素与第j+1个元素之和PASCAL Triangle的题目要求：输出PASCAL Triangle的前numRows行GivennumRows, generate the firstnumRowsof Pascal's triangle.Fo 阅读全文