原创 [Leetcode] 109. Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. /** * De
2020-06-26 23:05:46
原创 [Leetcode] 113. Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Gi
2020-02-23 19:43:18
原创 [Leetcode] 117. Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree
2020-02-23 19:43:18
原创 [Leetcode] 115. Distinct Subsequences
Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a
2020-02-23 19:43:18
原创 [Leetcode] 110. Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined a
2020-02-23 19:43:18
1
原创 [Leetcode] 108. Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. /** * Definition for
2020-02-23 19:43:18
原创 [Leetcode] 123. Best Time to Buy and Sell Stock III
Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find
2020-02-23 19:43:18
原创 [Leetcode] 114. Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5
2020-02-23 19:43:18
原创 [Leetcode] 107. Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level
2020-02-23 19:43:18
原创 [Leetcode] 111. Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from th
2020-02-23 19:43:18
原创 [Leetcode] 121. Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to
2020-02-23 19:43:18
原创 [Leetcode] 112. Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along
2020-02-23 19:43:18
原创 [Leetcode] 116. Populating Next Right Pointers in Each Node
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode
2020-02-23 19:43:18
原创 [Leetcode] 124. Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example: Gi
2020-02-23 19:43:18
原创 [Leetcode] 119. Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Co
2020-02-23 19:43:18