LeetCode 题目讲解集合

Hi 大家好，我是一个刷题爱好者，也是一个现役程序员。在我研究生找工作的时候就已经坚持每天刷一题了。并且在接触MD以前，都将自己的解题思想，不同的解法都详细的记录在本地文档中了。现在已经刷了八百多题目，详细记录了将近六百道题目的讲解了。但是腾挪上来需要时间，并且同时还有最新的题目更新。所以如果有小伙伴对于某一些题目有疑惑，希望博主可以早一点post出来的话，欢迎留言，我会优先上传你们有需要的。欢迎收藏我的博客。

LeetCode 题目集合

题号	难度	正文
1
33	Easy	Search in Rotated Sorted Array
146	Medium	LRU Cache
201	Medium	Bitwise AND of Numbers Range
367	Easy	Valid Perfect Square
383	Easy	Ransom Note
402	Medium	Remove K Digits
459	Easy	Repeated Substring Pattern
560	Medium	Subarray Sum Equals K
826	Medium	Most Profit Assigning Work
849	Easy	Maximize Distance to Closest Person
855	Medium	Exam Room
938	Easy	Range Sum of BST
986	Medium	Interval List Intersections
997	Easy	Find the Town Judge
1008	Medium	Construct Binary Search Tree from Preorder Traversal
1021	Easy	Remove Outermost Parentheses
1031	Medium	Maximum Sum of Two Non-Overlapping Subarrays
1155	Medium	Number of Dice Rolls With Target Sum
1143	Medium	Longest Common Subsequence
1218	Medium	Longest Arithmetic Subsequence of Given Difference
1254	Medium	Number of Closed Islands
1325	Medium	Delete Leaves With a Given Value
1340	Hard	Jump Game V
1342	Easy	Number of Steps to Reduce a Number to Zero
1347	Medium	Minimum Number of Steps to Make Two Strings Anagram
1365	Medium	How Many Numbers Are Smaller Than the Current Number
1376	Medium	Time Needed to Inform All Employees
1417	Easy	Reformat The String
1418	Medium	Display Table of Food Orders in a Restaurant
1419	Medium	Minimum Number of Frogs Croaking
1426	Medium	Counting Elements
1427	Easy	Perform String Shifts
1428	Medium	Leftmost Column with at Least a One
1429	Medium	First Unique Number
1430	Medium	Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
1433	Medium	Check If a String Can Break Another String