LeetCode 问题汇总(算法,难度,频率)

 
 


Id
Question
Difficulty
Frequency
Data Structures
Algorithms
1Two Sum25array + setsort + two pointers
2Add Two Numbers34linked listtwo pointers + math
3Longest Substring Without Repeating Characters32string + hashtabletwo pointers
4Median of Two Sorted Arrays53arraybinary search
5Longest Palindromic Substring42string 
6ZigZag Conversion31string 
7Reverse Integer23 math
8String to Integer (atoi)25stringmath
9Palindrome Number22 math
10Regular Expression Matching53stringrecursion + dp
11Container With Most Water32arraytwo pointers
12Integer to Roman34 math
13Roman to Integer24 math
14Longest Common Prefix21string 
153Sum35arraytwo pointers
163Sum Closest31arraytwo pointers
17Letter Combinations of a Phone Number33stringdfs
184Sum32array 
19Remove Nth Node From End of List23linked listtwo pointers
20Valid Parentheses25stringstack
21Merge Two Sorted Lists25linked listsort + two pointers + merge
22Generate Parentheses34stringdfs
23Merge k Sorted Lists34linked list + heapsort + two pointers + merge
24Swap Nodes in Pairs24linked list 
25Reverse Nodes in k-Group42linked listrecursion + two pointers
26Remove Duplicates from Sorted Array13arraytwo pointers
27Remove Element14arraytwo pointers
28Implement strStr()45stringtwo pointers + KMP + rolling hash
29Divide Two Integers43 binary search + math
30Substring with Concatenation of All Words31stringtwo pointers
31Next Permutation52arraypermutation
32Longest Valid Parentheses41stringdp
33Search in Rotated Sorted Array43arraybinary search
34Search for a Range43arraybinary search
35Search Insert Position22array 
36Valid Sudoku22array 
37Sudoku Solver42arraydfs
38Count and Say22stringtwo pointers
39Combination Sum33arraycombination
40Combination Sum II42arraycombination
41First Missing Positive52arraysort
42Trapping Rain Water42arraytwo pointers + stack
43Multiply Strings43stringtwo pointers + math
44Wildcard Matching53stringrecursion + dp + greedy
45Jump Game II42array 
46Permutations34arraypermutation
47Permutations II42arraypermutation
48Rotate Image42array 
49Anagrams34string + hashtable 
50Pow(x, n)35 binary search + math
51N-Queens43arraydfs
52N-Queens II43arraydfs
53Maximum Subarray33arraydp
54Spiral Matrix42array 
55Jump Game32array 
56Merge Intervals45array + linked list + red-black treesort + merge
57Insert Interval45array + linked list + red-black treesort + merge
58Length of Last Word11string 
59Spiral Matrix II32array 
60Permutation Sequence51 permutation + math
61Rotate List32linked listtwo pointers
62Unique Paths23arraydp
63Unique Paths II33arraydp
64Minimum Path Sum33arraydp
65Valid Number25stringmath
66Plus One12arraymath
67Add Binary24stringtwo pointers + math
68Text Justification42string 
69Sqrt(x)44 binary search
70Climbing Stairs25 dp
71Simplify Path31stringstack
72Edit Distance43stringdp
73Set Matrix Zeroes35array 
74Search a 2D Matrix33arraybinary search
75Sort Colors42arraysort + two pointers
76Minimum Window Substring42stringtwo pointers
77Combinations34 combination
78Subsets34arrayrecursion + combination
79Word Search34arraydfs
80Remove Duplicates from Sorted Array II22arraytwo pointers
81Search in Rotated Sorted Array II53arraybinary search
82Remove Duplicates from Sorted List II33linked listrecursion + two pointers
83Remove Duplicates from Sorted List13linked list 
84Largest Rectangle in Histogram52arraystack
85Maximal Rectangle51arraydp + stack
86Partition List33linked listtwo pointers
87Scramble String52stringrecursion + dp
88Merge Sorted Array25arraytwo pointers + merge
89Gray Code42 combination
90Subsets II42arrayrecursion + combination
91Decode Ways34stringrecursion + dp
92Reverse Linked List II32linked listtwo pointers
93Restore IP Addresses33stringdfs
94Binary Tree Inorder Traversal43tree + hashtablerecursion + morris + stack
95Unique Binary Search Trees II41treedp + dfs
96Unique Binary Search Trees31treedp
97Interleaving String52stringrecursion + dp
98Validate Binary Search Tree35treedfs
99Recover Binary Search Tree42treedfs
100Same Tree11treedfs
101Symmetric Tree12treedfs
102Binary Tree Level Order Traversal34treebfs
103Binary Tree Zigzag Level Order Traversal43queue + treebfs + stack
104Maximum Depth of Binary Tree11treedfs
105Construct Binary Tree from Preorder and Inorder Tr33array + treedfs
106Construct Binary Tree from Inorder and Postorder T33array + treedfs
107Binary Tree Level Order Traversal II31treebfs
108Convert Sorted Array to Binary Search Tree23treedfs
109Convert Sorted List to Binary Search Tree43linked listrecursion + two pointers
110Balanced Binary Tree12treedfs
111Minimum Depth of Binary Tree11treedfs
112Path Sum13treedfs
113Path Sum II22treedfs
114Flatten Binary Tree to Linked List33treerecursion + stack
115Distinct Subsequences42stringdp
116Populating Next Right Pointers in Each Node33treedfs
117Populating Next Right Pointers in Each Node II42treedfs
118Pascal's Triangle21array 
119Pascal's Triangle II21array 
120Triangle31arraydp
121Best Time to Buy and Sell Stock21arraydp
122Best Time to Buy and Sell Stock II31arraygreedy
123Best Time to Buy and Sell Stock III41arraydp
124Binary Tree Maximum Path Sum42treedfs
125Valid Palindrome25stringtwo pointers
126Word Ladder II11  
127Word Ladder35graphbfs + shortest path
128Longest Consecutive Sequence43array 
129Sum Root to Leaf Numbers24treedfs
130Surrounded Regions43arraybfs + dfs
131Palindrome Partitioning34stringdfs
132Palindrome Partitioning II43stringdp

原文地址http://wwwx.cs.unc.edu/~zhew/Leetcoder/

==============================================================================  我喜欢程序员,
他们单纯、固执、容易体会到成就感;
面对压力,能够挑灯夜战不眠不休;
面对困难,能够迎难而上挑战自我。
他们也会感到困惑与傍徨,
但每个程序员的心中都有一个比尔盖茨或是乔布斯的梦想“用智慧开创属于自己的事业”。
我想说的是,
其实我是一个程序员 ==============================================================================
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
资源包主要包含以下内容: ASP项目源码:每个资源包中都包含完整的ASP项目源码,这些源码采用了经典的ASP技术开发,结构清晰、注释详细,帮助用户轻松理解整个项目的逻辑和实现方式。通过这些源码,用户可以学习到ASP的基本语法、服务器端脚本编写方法、数据库操作、用户权限管理等关键技术。 数据库设计文件:为了方便用户更好地理解系统的后台逻辑,每个项目中都附带了完整的数据库设计文件。这些文件通常包括数据库结构图、数据表设计文档,以及示例数据SQL脚本。用户可以通过这些文件快速搭建项目所需的数据库环境,并了解各个数据表之间的关系和作用。 详细的开发文档:每个资源包都附有详细的开发文档,文档内容包括项目背景介绍、功能模块说明、系统流程图、用户界面设计以及关键代码解析等。这些文档为用户提供了深入的学习材料,使得即便是从零开始的开发者也能逐步掌握项目开发的全过程。 项目演示与使用指南:为帮助用户更好地理解和使用这些ASP项目,每个资源包中都包含项目的演示文件和使用指南。演示文件通常以视频或图文形式展示项目的主要功能和操作流程,使用指南则详细说明了如何配置开发环境、部署项目以及常见问题的解决方法。 毕业设计参考:对于正在准备毕业设计的学生来说,这些资源包是绝佳的参考材料。每个项目不仅功能完善、结构清晰,还符合常见的毕业设计要求和标准。通过这些项目,学生可以学习到如何从零开始构建一个完整的Web系统,并积累丰富的项目经验。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值