摘要：
LeetCode: Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path fro... 阅读全文
|
摘要：
LeetCode: Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path fro... 阅读全文
摘要：
LeetCode: Path SumGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equal... 阅读全文
摘要：
LeetCode: Flatten Binary Tree to Linked ListGiven a binary tree, flatten it to a linked list in-place. For example,Given 1 / \ 2 ... 阅读全文
摘要：
LeetCode: Distinct SubsequencesGiven a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new... 阅读全文
摘要：
LeetCode: Populating Next Right Pointer in Each NodeGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; ... 阅读全文
摘要：
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... 阅读全文
|