《LeetCode刷题指南-----Tags》

 

这些题会陆续在博客中写出解答,欢迎关注!!!                    

 

# [Array]

* 026. [Remove Duplicates from Sorted Array]
* 027. [Remove Element]
* 031. [Next Permutation]
* 041. [First Missing Positive]
* 054. [Spiral Matrix]
* 056. [Merge Intervals]
* 057. [Insert Interval]
* 059. [Spiral Matrix II]
* 073. [Set Matrix Zeroes]
* 118. [Pascal's Triangle]
* 119. [Pascal's Triangle II]
* 164. [Maximum Gap]
* 189. [Rotate Array]
* 228. [Summary Ranges]
* 283. [Move Zeroes]
* 289. [Game of Life]

# [String]

* 006. [ZigZag Conversion]
* 008. [String to Integer]
* 014. [Longest Common Prefix]
* 017. [Letter Combinations of a Phone Number]
* 028. [Implement strStr()]
* 038. [Count and Say]
* 058. [Length of Last Word]
* 067. [Add Binary]
* 068. [Text Justification]
* 151. [Reverse Words in a String]
* 165. [Compare Version Numbers]
* 344. [Reverse String]

# [Linked List]

* 002. [Add Two Numbers]
* 021. [Merge Two Sorted Lists]
* 024. [Swap Nodes in Pairs]
* 025. [Reverse Nodes in k-Group]
* 061. [Rotate List]
* 076. [Minimum Window Substring]
* 082. [Remove Duplicates from Sorted List II]
* 083. [Remove Duplicates from Sorted List]
* 086. [Partition List]
* 092. [Reverse Linked List II]
* 138. [Copy List with Random Pointer]
* 143. [Reorder List]
* 147. [Insertion Sort List]
* 148. [Sort List]
* 160. [Intersection of Two Linked Lists]
* 203. [Remove Linked List Elements]
* 206. [Reverse Linked List]
* 234. [Palindrome Linked List]
* 237. [Delete Node in a Linked List]
* 328. [Odd Even Linked List]

# [Tree]

* 094. [Binary Tree Inorder Traversa]
* 095. [Unique Binary Search Trees II]
* 096. [Unique Binary Search Trees]
* 099. [Recover Binary Search Tree]
* 100. [Same Tree]
* 105. [Construct Binary Tree from Preorder and Inorder Traversal]
* 106. [Construct Binary Tree from Inorder and Postorder Traversal]
* 108. [Convert Sorted Array to Binary Search Tree]
* 109. [Convert Sorted List to Binary Search Tree]
* 110. [Balanced Binary Tree]
* 111. [Minimum Depth of Binary Tree]
* 112. [Path Sum]
* 113. [Path Sum II]
* 114. [Flatten Binary Tree to Linked List]
* 116. [Populating Next Right Pointers in Each Node]
* 117. [Populating Next Right Pointers in Each Node II]
* 124. [Binary Tree Maximum Path Sum]
* 144. [Binary Tree Preorder Traversal]
* 145. [Binary Tree Postorder Traversal]
* 173. [Binary Search Tree Iterator]
* 208. [Implement Trie (Prefix Tree)]
* 211. [Add and Search Word]
* 226. [Invert Binary Tree]
* 235. [Lowest Common Ancestor of a Binary Search Tree]
* 236. [Lowest Common Ancestor of a Binary Tree]
* 297. [Serialize and Deserialize Binary Tree]
* 331. [Verify Preorder Serialization of a Binary Tree]

# [Hash Table]

* 001. [Two Sum]
* 003. [Longest Substring Without Repeating Characters]
* 018. `4Sum`
* 036. [Valid Sudoku]
* 049. [Group Anagrams]
* 128. [Longest Consecutive Sequence]
* 146. [LRU Cache]
* 149. [Max Points on a Line]
* 187. [Repeated DNA Sequences]
* 205. [Isomorphic Strings]
* 217. [Contains Duplicate]
* 219. [Contains Duplicate II]
* 242. [Valid Anagram]
* 257. [Binary Tree Paths]
* 274. [H-Index]
* 290. [Word Pattern]
* 299. [Bulls and Cows]
* 349. [Intersection of Two Arrays]
* 350. [Intersection of Two Arrays II]

# [Heap]


* 023. [Merge k Sorted Lists]
* 295. [Find Median from Data Stream]
* 347. [Top K Frequent Elements]

# [Binary Search]

* 004. [Median of Two Sorted Arrays]
* 033. [Search in Rotated Sorted Array]
* 034. [Search for a Range]
* 069. [Sqrt(x)]
* 074. [Search a 2D Matrix]
* 081. [Search in Rotated Sorted Array II]
* 153. [Find Minimum in Rotated Sorted Array]
* 154. [Find Minimum in Rotated Sorted Array II]
* 162. [Find Peak Element]
* 222. [Count Complete Tree Nodes]
* 230. [Kth Smallest Element in a BST]
* 275. [H-Index II]
* 278. [First Bad Version]
* 367. [Valid Perfect Square]

# [Depth-first Search]

* 098. [Validate Binary Search Tree]
* 126. [Word Ladder II]
* 129. [Sum Root to Leaf Numbers]
* 140. [Word Break II]
* 200. [Number of Islands]
* 301. [Remove Invalid Parentheses]
* 306. [Additive Number]

# [Breadth-first Search]

* 102. [Binary Tree Level Order Traversal]
* 103. [Binary Tree Zigzag Level OrderTraversal]
* 104. [Maximum Depth Of BinaryTree]
* 107. [Binary Tree Level Order Traversal II]
* 126. [Word Ladder II]
* 127. [Word Ladder]
* 130. [Surrounded Regions]
* 199. [Binary Tree Right Side View]
* 310. [Minimum Height Trees]
* 322. [Coin Change]

# [Backtracking]

* 022. [Generate Parentheses]
* 039. [Combination Sum]
* 046. [Permutations]
* 047. [Permutations II]
* 051. [N-Queens]
* 052. [N-Queens II]
* 079. [Word Search]
* 090. [Subsets II]
* 093. [Restore IP Addresses]
* 131. [Palindrome Partitioning]
* 216. [Combination Sum III]

# [Recursion]

* 060. Permutation Sequence
* 077. [Combinations]
* 089. [Gray Code]
* 101. [Symmetric Tree]


# [Dynamic Programming]

* 010. [Regular Expression Matching]
* 032. [Longest Valid Parentheses]
* 044. [Wildcard Matching]
* 053. [Maximum Subarray]
* 062. [Unique Paths]
* 063. [Unique Paths II]
* 064. [Minimum Path Sum]
* 070. [Climbing Stairs]
* 072. [Edit Distance]
* 087. [Scramble String]
* 091. [Decode Ways]
* 097. [Interleaving String]
* 115. [Distinct Subsequences]
* 120. [Triangle]
* 121. [Best Time to Buy and Sell Stock]
* 123. [Best Time to Buy and Sell Stock III]
* 132. [Palindrome Partitioning II]
* 135. [Candy]
* 139. [Word Break]
* 152. [Maximum Product Subarray]
* 174. [Dungeon Game]
* 188. [Best Time to Buy and Sell Stock IV]
* 198. [House Robber]
* 213. [House Robber II]
* 221. [Maximal Square]
* 264. [Ugly Number II]
* 279. [Perfect Squares]
* 303. [Range Sum Query - Immutable]
* 304. [Range Sum Query 2D - Immutable]
* 309. [Best Time to Buy and Sell Stock with Cooldown]
* 313. [Super Ugly Number]
* 337. [House Robber III]
* 368. [Largest Divisible Subset]
* 357. [Count Numbers with Unique Digits]

# [Greedy]

* 045. [Jump Game II]
* 055. [Jump Game]
* 122. [Best Time to Buy and Sell Stock II]
* 134. [Gas Station]
* 316. [Remove Duplicate Letters]
* 330. [Patching Array]

# [Stack]

* 020. [Valid Parentheses]
* 032. [Longest Valid Parentheses]
* 071. [Simplify Path]
* 084. [Largest Rectangle in Histogram]
* 085. [Maximal Rectangle]
* 094. [Binary Tree Inorder Traversal]
* 150. [Evaluate Reverse Polish Notation]
* 155. [Min Stack]
* 224. [Basic Calculator]
* 225. [Implement Stack using Queues]
* 227. [Basic Calculator II]
* 232. [Implement Queue using Stacks]
* 316. [Remove Duplicate Letters]
* 341. [Flatten Nested List Iterator]

#  [Two Pointers]

* 011. [Container With Most Water]
* 015. [3Sum]
* 016. [3Sum Closest]
* 018. [4Sum]
* 019. [Remove Nth Node From End of List]
* 042. [Trapping Rain Water]
* 075. [Sort Colors]
* 080. [Remove Duplicates from Sorted Array II]
* 088. [Merge Sorted Array]
* 125. [Valid Palindrome]
* 141. [Linked List Cycle]
* 142. [Linked List Cycle II]
* 209. [Minimum Size Subarray Sum]
* 283. [Move Zeroes]
* 287. [Find the Duplicate Number]
* 345. [Reverse Vowels of a String]


# [Math]

* 007. [Reverse Integer]
* 009. [Palindrome Number]
* 012. [Integer to Roman]
* 013. [Roman to Integer]
* 048. [Rotate Image]
* 043. [Multiply Strings]
* 050. [Pow(x, n)]
* 060. [Permutation Sequence]
* 066. [Plus One]
* 069. Sqrt(x)
* 166. [Fraction to Recurring Decimal]
* 168. [Excel Sheet Column Title]
* 171. [Excel Sheet Column Number]
* 172. [Factorial Trailing Zeroes]
* 179. [Largest Number]
* 202. [Happy Number]
* 204. [Count Primes]
* 223. [Rectangle Area]
* 233. [Number of Digit One]
* 238. [Product of Array Except Self]
* 258. [Add Digits]
* 263. [Ugly Number]
* 273. [Integer to English Words]
* 292. [Nim Game]
* 326. [Power of Three]
* 319. [Bulb Switcher]
* 335. [Self Crossing]
* 343. [Integer Break]

# [Bit Manipulation]

* 029. [Divide Two Integers]
* 078. [Subsets]
* 136. [Single Number]
* 137. [Single Number II]
* 169. [Majority Element]
* 190. [Reverse Bits]
* 191. [Number of 1 Bits]
* 201. [Bitwise AND of Numbers Range]
* 231. [Power of Two]
* 260. [Single Number III]
* 268. [Missing Number]
* 318. [Maximum Product of Word Lengths]
* 338. [Counting Bits]
* 371. [Sum of Two Integers]
* 342. [Power of Four]

# [Graph]

* 133. [Clone Graph]
* 207. [Course Schedule]
* 210. [Course Schedule II]

# Combination

* 030. [Substring with Concatenation of All Words]
* 037. [Sudoku Solver]
* 140. [Word Break II]
* 146. [LRU Cache]
* 300. [Longest Increasing Subsequence]
* 324. [Wiggle Sort II]
* 329. [Longest Increasing Path in a Matrix]
* 355. [Design Twitter]

# DFA

* 065. [Valid Number]

# [Divide and Conquer]

* 215. [Kth Largest Element in an Array]
* 240. [Search a 2D Matrix II]
* 241. [Different Ways to Add Parentheses]

# Others

* 220. [Contains Duplicate III]
* 229. [Majority Element II]
* 239. [Sliding Window Maximum]
* 284. [Peeking Iterator]
* 307. [Range Sum Query - Mutable]
 

  • 5
    点赞
  • 4
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值