ICode9

精准搜索请尝试: 精确搜索
首页 > 其他分享> 文章详细

【leetcode】高频题目整理_动态规划篇( High Frequency Problems, Dynamic Programming )

2021-04-18 07:52:07  阅读:307  来源: 互联网

标签:Sell 题目 困难 Sum Problems Dynamic High 中等 Time


截止至今LeetCode题目总量已经有1582题,估计将来每年平均增长300题左右,大部分人肯定是刷不完的,所以得有选择地刷LeetCode。

一种公认的刷题策略是按类别刷题,可是每个类别也有许多题,在有限的时间里到底该刷哪些题呢?个人根据LeetCode官方给出的每个题目的出现频率,整理并收录了每个类别里高频出现的题目,对于官方统计频率太低的题目,不予收录,最终得到了这个高频题目表格。

例如,对于下图中题号#275#270的题目将被收录,并且#275出现频率大于#270;而对于题号#1011#1182的题目,因为出现频率太低,将不被收录:在这里插入图片描述

撸起键盘加油干!祝大家成功上岸!整理不易,点个赞吧!


动态规划篇-110题(Dynamic Programming, 110 problems)

数据日期: 2020/03/26 (此时LeetCode题目数量:1582)
数据来源: LeetCode官方,将不同类别的题目按照官方给的出现频率(Frequency)降序排列,取有频率统计的题。

排序题号题目通过率难度
1#5Longest Palindromic Substring0.291中等
2#53Maximum Subarray0.499简单
3#85Maximal Rectangle0.449困难
4#95Unique Binary Search Trees II0.623中等
5#10Regular Expression Matching0.269困难
6#72Edit Distance0.567困难
7#96Unique Binary Search Trees0.652中等
8#312Burst Balloons0.584困难
9#70Climbing Stairs0.481简单
10#121Best Time to Buy and Sell Stock0.538简单
11#64Minimum Path Sum0.651中等
12#309Best Time to Buy and Sell Stock with Cooldown0.528中等
13#546Remove Boxes0.496困难
14#120Triangle0.641中等
15#552Student Attendance Record II0.392困难
16#698Partition to K Equal Sum Subsets0.41中等
17#303Range Sum Query - Immutable0.606简单
18#300Longest Increasing Subsequence0.44中等
19#516Longest Palindromic Subsequence0.518中等
20#221Maximal Square0.393中等
21#32Longest Valid Parentheses0.3困难
22#357Count Numbers with Unique Digits0.507中等
23#198House Robber0.44简单
24#264Ugly Number II0.508中等
25#877Stone Game0.679中等
26#466Count The Repetitions0.3困难
27#718Maximum Length of Repeated Subarray0.492中等
28#375Guess Number Higher or Lower II0.372中等
29#279Perfect Squares0.551中等
30#413Arithmetic Slices0.602中等
31#673Number of Longest Increasing Subsequence0.348中等
32#647Palindromic Substrings0.613中等
33#410Split Array Largest Sum0.414困难
34#363Max Sum of Rectangle No Larger Than K0.348困难
35#97Interleaving String0.393困难
36#132Palindrome Partitioning II0.426困难
37#62Unique Paths0.596中等
38#368Largest Divisible Subset0.371中等
39#338Counting Bits0.749中等
40#689Maximum Sum of 3 Non-Overlapping Subarrays0.445困难
41#87Scramble String0.459困难
42#322Coin Change0.387中等
43#464Can I Win0.333中等
44#139Word Break0.441中等
45#638Shopping Offers0.571中等
46#343Integer Break0.553中等
47#664Strange Printer0.43困难
48#174Dungeon Game0.404困难
49#152Maximum Product Subarray0.377中等
50#321Create Maximum Number0.278困难
51#6502 Keys Keyboard0.486中等
52#600Non-negative Integers without Consecutive Ones0.305困难
53#123Best Time to Buy and Sell Stock III0.422困难
54#629K Inverse Pairs Array0.365困难
55#486Predict the Winner0.508中等
56#712Minimum ASCII Delete Sum for Two Strings0.62中等
57#91Decode Ways0.233中等
58#351Android Unlock Patterns0.59中等
59#730Count Different Palindromic Subsequences0.474困难
60#474Ones and Zeroes0.514中等
61#213House Robber II0.37中等
62#354Russian Doll Envelopes0.346困难
63#741Cherry Pickup0.308困难
64#956Tallest Billboard0.373困难
65#639Decode Ways II0.264困难
66#688Knight Probability in Chessboard0.463中等
67#740Delete and Earn0.512中等
68#1025Divisor Game0.689简单
69#392Is Subsequence0.486简单
70#1240Tiling a Rectangle with the Fewest Squares0.453困难
71#115Distinct Subsequences0.474困难
72#44Wildcard Matching0.271困难
73#1130Minimum Cost Tree From Leaf Values0.572中等
74#714Best Time to Buy and Sell Stock with Transaction Fee0.635中等
75#188Best Time to Buy and Sell Stock IV0.294困难
76#646Maximum Length of Pair Chain0.534中等
77#967Numbers With Same Consecutive Differences0.355中等
78#691Stickers to Spell Word0.448困难
79#403Frog Jump0.335困难
80#902Numbers At Most N Given Digit Set0.284困难
81#377Combination Sum IV0.413中等
82#63Unique Paths II0.326中等
83#514Freedom Trail0.38困难
84#494Target Sum0.441中等
85#467Unique Substrings in Wraparound String0.403中等
86#416Partition Equal Subset Sum0.461中等
87#376Wiggle Subsequence0.415中等
88#140Word Break II0.376困难
89#1000Minimum Cost to Merge Stones0.307困难
90#523Continuous Subarray Sum0.229中等
91#576Out of Boundary Paths0.36中等
92#517Super Washing Machines0.408困难
93#256Paint House0.569简单
94#361Bomb Enemy0.519中等
95#304Range Sum Query 2D - Immutable0.431中等
96#472Concatenated Words0.438困难
97#656Coin Path0.284困难
98#1024Video Stitching0.461中等
99#446Arithmetic Slices II - Subsequence0.323困难
100#6514 Keys Keyboard0.573中等
101#276Paint Fence0.436简单
102#471Encode String with Shortest Length0.527困难
103#1388Pizza With 3n Slices0.395困难
104#1220Count Vowels Permutation0.526困难
105#265Paint House II0.518困难
106#568Maximum Vacation Days0.451困难
107#727Minimum Window Subsequence0.398困难
108#418Sentence Screen Fitting0.343中等
109#1277Count Square Submatrices with All Ones0.665中等
110#1067Digit Count in Range0.349困难

相关/参考链接

leetcode-cn
leetcode

标签:Sell,题目,困难,Sum,Problems,Dynamic,High,中等,Time
来源: https://blog.51cto.com/u_11934066/2714621

本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享;
2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关;
3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关;
4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除;
5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有