摘要：
LeetCode: pascal's TriangleGiven numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return[ [1], [1,1], ... 阅读全文
|
摘要：
LeetCode: pascal's TriangleGiven numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return[ [1], [1,1], ... 阅读全文
摘要：
LeetCode: TriangleGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For exa... 阅读全文
摘要：
LeetCode: Best Time to Buy and Sell StockSay you have an array for which the ith element is the price of a given stock on day i.If you were only permi... 阅读全文
摘要：
LeetCode: Binary Tree Maximum Path SumGiven a binary tree, find the maximum path sum.The path may start and end at any node in the tree. For example:G... 阅读全文
摘要：
LeetCode: Valid PalindromeGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A... 阅读全文
|