leetcode
2323不是呆萌兽
这个作者很懒,什么都没留下…
展开
-
triangle(三角形)——leetcode
题目如下: 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]原创 2017-05-23 16:51:07 · 405 阅读 · 0 评论 -
MinPathSum(leetcode)
题目: Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down o原创 2017-05-26 23:32:47 · 364 阅读 · 0 评论 -
ClimbingStairs(leetcode)
题目: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?题解:public static int c原创 2017-05-26 23:36:22 · 220 阅读 · 0 评论