😇
LeetCode Notebook
Ctrlk
  • Introduction
  • Useful Java knowledge
  • Useful Python knowledges
  • 完全按照九章算法刷的,70道左右
    • I. Binary Search
    • II. Sorted Array
    • III. Binary Tree
    • IV. Permutations and Subsets
    • VI. Linked List
    • IX. Dynamic Programming
  • 开始自己刷,冲刺100道,主要是binarySearch&Tree
    • 981. Time Based Key-Value Store
    • 111. Minimum Depth of Binary Tree
    • 112. Path Sum
    • 113. Path Sum II
    • 100. Same Tree
    • 101. Symmetric Tree
    • 96. Unique Binary Search Trees
    • 108. Convert Sorted Array to Binary Search Tree
    • 226. Invert Binary Tree
    • 95. Unique Binary Search Trees II
    • 50. Pow(x, n)
    • 69. Sqrt(x)
    • 167. Two Sum II - Input array is sorted
    • 29. Divide Two Integers*
    • 349. Intersection of Two Arrays
    • 287. Find the Duplicate Number
    • 222. Count Complete Tree Nodes
    • 350. Intersection of Two Arrays II
    • 257. Binary Tree Paths
    • 404. Sum of Left Leaves
    • 437. Path Sum III
    • 7. Reverse Integer
    • 21. Merge Two Sorted Lists
    • 279. Perfect Squares
    • 199. Binary Tree Right Side View
    • 114. Flatten Binary Tree to Linked List
    • 129. Sum Root to Leaf Numbers
    • 198. House Robber
    • 213. House Robber II
    • 337. House Robber III
    • 236. Lowest Common Ancestor of a Binary Tree
  • 终于刷到100道了,我是分水岭,开始按照网上推荐重点250道题
    • 补充1-20道
  • 补充21-40道
    • 53. Maximum Subarray
    • 66. Plus One
    • 67. Add Binary
    • 71. Simplify Path
    • 75. Sort Colors
    • 77. Combinations
    • 79. Word Search
    • 91. Decode Ways
    • 116. Populating Next Right Pointers in Each Node
    • 117. Populating Next Right Pointers in Each Node II
    • 121. Best Time to Buy and Sell Stock
    • 122. Best Time to Buy and Sell Stock II
    • 125. Valid Palindrome
    • 133. Clone Graph
    • 134. Gas Station
    • 146. LRU Cache
    • 150. Evaluate Reverse Polish Notation
    • 152. Maximum Product Subarray
    • 155. Min Stack
    • 157. Read N Characters Given Read4
  • 补充41-60道
  • 补充61-80道
  • 补充81-100道
Powered by GitBook
On this page

Was this helpful?

补充21-40道

53. Maximum Subarray66. Plus One67. Add Binary71. Simplify Path75. Sort Colors77. Combinations79. Word Search91. Decode Ways116. Populating Next Right Pointers in Each Node117. Populating Next Right Pointers in Each Node II121. Best Time to Buy and Sell Stock122. Best Time to Buy and Sell Stock II125. Valid Palindrome133. Clone Graph134. Gas Station146. LRU Cache150. Evaluate Reverse Polish Notation152. Maximum Product Subarray155. Min Stack157. Read N Characters Given Read4
Previous49. Group AnagramsNext53. Maximum Subarray

Last updated 5 years ago

Was this helpful?