leetcode

leetcode解题代码c++实现可能有些疏漏，在网页端改了但本地没改，刷的比较早，已经没法用leetcode的retrieve如果发现代码无法AC请联系我

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
100. Same Tree.cpp		100. Same Tree.cpp
101. Symmetric Tree.cpp		101. Symmetric Tree.cpp
102. Binary Tree Level Order Traversal.cpp		102. Binary Tree Level Order Traversal.cpp
103. Binary Tree Zigzag Level Order Traversal.cpp		103. Binary Tree Zigzag Level Order Traversal.cpp
104. Maximum Depth of Binary Tree.cpp		104. Maximum Depth of Binary Tree.cpp
105. Construct Binary Tree from Preorder and Inorder Traversal.cpp		105. Construct Binary Tree from Preorder and Inorder Traversal.cpp
106. Construct Binary Tree from Inorder and Postorder Traversal.cpp		106. Construct Binary Tree from Inorder and Postorder Traversal.cpp
107. Binary Tree Level Order Traversal II.cpp		107. Binary Tree Level Order Traversal II.cpp
108. Convert Sorted Array to Binary Search Tree.cpp		108. Convert Sorted Array to Binary Search Tree.cpp
109. Convert Sorted List to Binary Search Tree.cpp		109. Convert Sorted List to Binary Search Tree.cpp
11. Container With Most Water.cpp		11. Container With Most Water.cpp
110. Balanced Binary Tree.cpp		110. Balanced Binary Tree.cpp
111. Minimum Depth of Binary Tree.cpp		111. Minimum Depth of Binary Tree.cpp
112. Path Sum.cpp		112. Path Sum.cpp
113. Path Sum II.cpp		113. Path Sum II.cpp
114. Flatten Binary Tree to Linked List.cpp		114. Flatten Binary Tree to Linked List.cpp
116. Populating Next Right Pointers in Each Node.cpp		116. Populating Next Right Pointers in Each Node.cpp
117. Populating Next Right Pointers in Each Node II.cpp		117. Populating Next Right Pointers in Each Node II.cpp
118. Pascal's Triangle.cpp		118. Pascal's Triangle.cpp
119. Pascal's Triangle II.cpp		119. Pascal's Triangle II.cpp
121. Best Time to Buy and Sell Stock.cpp		121. Best Time to Buy and Sell Stock.cpp
122. Best Time to Buy and Sell Stock II.cpp		122. Best Time to Buy and Sell Stock II.cpp
123. Best Time to Buy and Sell Stock III.cpp		123. Best Time to Buy and Sell Stock III.cpp
128. Longest Consecutive Sequence.cpp		128. Longest Consecutive Sequence.cpp
129. Sum Root to Leaf Numbers.cpp		129. Sum Root to Leaf Numbers.cpp
14. Longest Common Prefix.cpp		14. Longest Common Prefix.cpp
144. Binary Tree Preorder Traversal.cpp		144. Binary Tree Preorder Traversal.cpp
145. Binary Tree Postorder Traversal.cpp		145. Binary Tree Postorder Traversal.cpp
146. LRU Cache.cpp		146. LRU Cache.cpp
153. Find Minimum in Rotated Sorted Array.cpp		153. Find Minimum in Rotated Sorted Array.cpp
154. Find Minimum in Rotated Sorted Array II.cpp		154. Find Minimum in Rotated Sorted Array II.cpp
155. Min Stack.cpp		155. Min Stack.cpp
162. Find Peak Element lgN.cpp		162. Find Peak Element lgN.cpp
162. Find Peak Element.cpp		162. Find Peak Element.cpp
17. Letter Combinations of a Phone Number.cpp		17. Letter Combinations of a Phone Number.cpp
189. Rotate Array.cpp		189. Rotate Array.cpp
191. Number of 1 Bits.cpp		191. Number of 1 Bits.cpp
207. Course Schedule.cpp		207. Course Schedule.cpp
208. Implement Trie (Prefix Tree) .cpp		208. Implement Trie (Prefix Tree) .cpp
212. Word Search II.cpp		212. Word Search II.cpp
216. Combination Sum III(高效).cpp		216. Combination Sum III(高效).cpp
216. Combination Sum III.cpp		216. Combination Sum III.cpp
217. Contains Duplicate.cpp		217. Contains Duplicate.cpp
219. Contains Duplicate II.cpp		219. Contains Duplicate II.cpp
220. Contains Duplicate III.cpp		220. Contains Duplicate III.cpp
225. Implement Stack using Queues.cpp		225. Implement Stack using Queues.cpp
228. Summary Ranges.cpp		228. Summary Ranges.cpp
231. Power of Two.cpp		231. Power of Two.cpp
231. Power of Two2(解答).cpp		231. Power of Two2(解答).cpp
232. Implement Queue using Stacks.cpp		232. Implement Queue using Stacks.cpp
257. Binary Tree Paths.cpp		257. Binary Tree Paths.cpp
26. Remove Duplicates from Sorted Array.cpp		26. Remove Duplicates from Sorted Array.cpp
268. Missing Number.cpp		268. Missing Number.cpp
27. Remove Element.cpp		27. Remove Element.cpp
289. Game of Life.cpp		289. Game of Life.cpp
290. Word Pattern.cpp		290. Word Pattern.cpp
3. Longest Substring Without Repeating Characters.cpp		3. Longest Substring Without Repeating Characters.cpp
309. Best Time to Buy and Sell Stock with Cooldown.cpp		309. Best Time to Buy and Sell Stock with Cooldown.cpp
310. Minimum Height Trees.cpp		310. Minimum Height Trees.cpp
326. Power of Three .cpp		326. Power of Three .cpp
34. Search for a Range.cpp		34. Search for a Range.cpp
35. Search Insert Position.cpp		35. Search Insert Position.cpp
39. Combination Sum.cpp		39. Combination Sum.cpp
4. Median of Two Sorted Arrays.cpp		4. Median of Two Sorted Arrays.cpp
40. Combination Sum II.cpp		40. Combination Sum II.cpp
41. First Missing Positive.cpp		41. First Missing Positive.cpp
42. Trapping Rain Water.cpp		42. Trapping Rain Water.cpp
43. Multiply Strings.cpp		43. Multiply Strings.cpp
51. N-Queens.cpp		51. N-Queens.cpp
52. N-Queens II.cpp		52. N-Queens II.cpp
6. ZigZag Conversion.cpp		6. ZigZag Conversion.cpp
62. Unique Paths.cpp		62. Unique Paths.cpp
65. Valid Number.cpp		65. Valid Number.cpp
66. Plus One.cpp		66. Plus One.cpp
7. Reverse Integer.cpp		7. Reverse Integer.cpp
77. Combinations.cpp		77. Combinations.cpp
78. Subsets.cpp		78. Subsets.cpp
79. Word Search.cpp		79. Word Search.cpp
8. String to Integer (atoi).cpp		8. String to Integer (atoi).cpp
80. Remove Duplicates from Sorted Array II.cpp		80. Remove Duplicates from Sorted Array II.cpp
84. Largest Rectangle in Histogram.cpp		84. Largest Rectangle in Histogram.cpp
85. Maximal Rectangle.cpp		85. Maximal Rectangle.cpp
88. Merge Sorted Array.cpp		88. Merge Sorted Array.cpp
9. Palindrome Number.cpp		9. Palindrome Number.cpp
90. Subsets II.cpp		90. Subsets II.cpp
94. Binary Tree Inorder Traversal.cpp		94. Binary Tree Inorder Traversal.cpp
98. Validate Binary Search Tree.cpp		98. Validate Binary Search Tree.cpp
99. Recover Binary Search Tree.cpp		99. Recover Binary Search Tree.cpp
README.md		README.md

zslomo/leetcode

Folders and files

Latest commit

History