摘要：Note: 后面数字n表明刷的第n + 1遍, 如果题目有**, 表明有待总结 Conclusion questions: [LeetCode] questions conclustion_BFS, DFS LeetCode questions conclustion_Path in Tree [L 阅读全文
[LeetCode] All questions numbers conclusion 所有题目题号
2018-08-07 00:50 by Johnson_强生仔仔, 516 阅读, 0 推荐, 收藏, 编辑[LeetCode] 110. Balanced Binary Tree_Easy tag: DFS
2018-08-07 00:49 by Johnson_强生仔仔, 223 阅读, 0 推荐, 收藏, 编辑
摘要：Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the dep 阅读全文
[LeetCode] questions conclusion_ Dynamic Programming
2018-08-06 23:49 by Johnson_强生仔仔, 336 阅读, 0 推荐, 收藏, 编辑
摘要：Questions: [LeetCode] 198. House Robber _Easy tag: Dynamic Programming [LeetCode] 221. Maximal Square _ Medium Tag: Dynamic Programming [LeetCode] 62. 阅读全文
[LeetCode] 111. Minimum Depth of Binary Tree_Easy tag:DFS
2018-08-06 23:19 by Johnson_强生仔仔, 205 阅读, 0 推荐, 收藏, 编辑
摘要：Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
[LeetCode] 122. Best Time to Buy and Sell Stock II_Easy tag: Dynamic Programming
2018-08-03 23:51 by Johnson_强生仔仔, 242 阅读, 0 推荐, 收藏, 编辑
摘要：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 the maximum profit. You may comple 阅读全文
[LeetCode] 121. Best Time to Buy and Sell Stock_Easy tag: Dynamic Programming
2018-08-03 23:27 by Johnson_强生仔仔, 216 阅读, 0 推荐, 收藏, 编辑
摘要：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 complete at most one transaction 阅读全文
[LeetCode] 674. Longest Continuous Increasing Subsequence_Easy Dynamic Programming
2018-08-02 09:18 by Johnson_强生仔仔, 234 阅读, 0 推荐, 收藏, 编辑
摘要：Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray). Example 1: Example 2: Note: Length of th 阅读全文
[LeetCode] 152. Maximum Product Subarray_Medium tag: Dynamic Programming
2018-08-02 05:46 by Johnson_强生仔仔, 223 阅读, 0 推荐, 收藏, 编辑
摘要：Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example 1: I 阅读全文
[LeetCode] 53. Maximum Subarray_Easy tag: Dynamic Programming
2018-08-02 04:39 by Johnson_强生仔仔, 320 阅读, 0 推荐, 收藏, 编辑
摘要：Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: 3.2) 阅读全文
[LeetCode] 312. Burst Balloons_hard tag: 区间Dynamic Programming
2018-08-01 05:07 by Johnson_强生仔仔, 280 阅读, 0 推荐, 收藏, 编辑
摘要：Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloon 阅读全文