力扣300未加锁&&剑指offer&&力扣hot100不会的题

Myth丶恋晨 2022-10-25 00:48 69阅读 0赞

# [二分查找][Link 1] #

# [滑动窗口][Link 2] #

# [优先队列（堆）][Link 3] #

# [分治][Link 4] #

# 栈 #

1.[LeetCode 232. 用栈实现队列][LeetCode 232.]

# 树 #

1.[LeetCode 116. 填充每个节点的下一个右侧节点指针][LeetCode 116.]  
2.[LeetCode 117. 填充每个节点的下一个右侧节点指针 II][LeetCode 117. _ II]

# 链表 #

1.[字节跳动高频面试题之排序奇升偶降链表][Link 5]  
2.[LeetCode 148. 排序链表][LeetCode 148.]

# 树状数组（线段树） #

[通用线段树的写法][Link 6]  
[这个307题解链接里面包含了三种线段树模板：1.数组递归2.结点递归3.数组迭代][307_1._2._3.]  
[官方的307题解给出了数组迭代方式线段树才能通过不知道为什么][307]  
1.[LeetCode 315. 计算右侧小于当前元素的个数][LeetCode 315.]  
2.[LeetCode 307. 区域和检索 - 数组可修改][LeetCode 307. _ -]  
3.[LeetCode 327. 区间和的个数 代码中的树状数组和线段树模板中规中矩][LeetCode 327. _]  
4.[LeetCode 493. 翻转对][LeetCode 493.]  
5.[LeetCode 421. 数组中两个数的最大异或值][LeetCode 421.]

# Trie树 #

1.[LeetCode 208. 实现 Trie (前缀树) 模板题][LeetCode 208. _ Trie _]  
2.[LeetCode 211. 添加与搜索单词 - 数据结构设计][LeetCode 211. _ -]  
3.[LeetCode 212. 单词搜索 II][LeetCode 212. _ II]  
4.[LeetCode 336. 回文对][LeetCode 336.]

# 双指针 #

1.[LeetCode 11. 盛最多水的容器][LeetCode 11.]  
2.[LeetCode 15. 三数之和][LeetCode 15.]  
3.[LeetCode 16. 最接近的三数之和][LeetCode 16.]  
4.[LeetCode 18. 四数之和][LeetCode 18.]  
5.[LeetCode 28. 实现 strStr()][LeetCode 28. _ strStr]  
6.[LeetCode 30. 串联所有单词的子串][LeetCode 30.]  
7.[LeetCode 42. 接雨水][LeetCode 42.]  
8.[LeetCode 61. 旋转链表][LeetCode 61.]  
9.[LeetCode 75. 颜色分类][LeetCode 75.]  
10.[LeetCode 88. 合并两个有序数组][LeetCode 88.]  
11.[LeetCode 142. 环形链表 II][LeetCode 142. _ II]  
12.[LeetCode 234. 回文链表][LeetCode 234.]

# 回溯 #

1.[LeetCode 39. 组合总和][LeetCode 39.]  
2.[LeetCode 40. 组合总和 II][LeetCode 40. _ II]  
3.[LeetCode 47. 全排列 II][LeetCode 47. _ II]  
4.[LeetCode 89. 格雷编码][LeetCode 89.]  
5.[LeetCode 93. 复原 IP 地址][LeetCode 93. _ IP]  
6.[LeetCode 131. 分割回文串][LeetCode 131.]  
7.[剑指 Offer 38. 字符串的排列][Offer 38.]  
8.[剑指 Offer 34. 二叉树中和为某一值的路径 || LeetCode 113. 路径总和 II][Offer 34. _ _ LeetCode 113. _ II]  
9.[剑指 Offer 55 - II. 平衡二叉树 || 110. 平衡二叉树][Offer 55 - II. _ _ 110.]  
10.[LeetCode 98. 验证二叉搜索树][LeetCode 98.]  
11.[LeetCode 109. 有序链表转换二叉搜索树][LeetCode 109.]  
12.[LeetCode 114. 二叉树展开为链表][LeetCode 114.]  
13.[LeetCode 133. 克隆图][LeetCode 133.]

# 数组 #

1.[LeetCode 448. 找到所有数组中消失的数字][LeetCode 448.]

# dp #

**区间dp**  
1.[LeetCode 312. 戳气球][LeetCode 312.]  
2.[LeetCode 132. 分割回文串 II][LeetCode 132. _ II]  
**位运算相关**  
1.[LeetCode 338. 比特位计数][LeetCode 338.]

[Link 1]: https://blog.csdn.net/weixin_38199770/category_10782628.html
[Link 2]: https://blog.csdn.net/weixin_38199770/category_10789520.html
[Link 3]: https://blog.csdn.net/weixin_38199770/category_10791843.html
[Link 4]: https://blog.csdn.net/weixin_38199770/category_10802426.html
[LeetCode 232.]: https://blog.csdn.net/weixin_38199770/article/details/114385956
[LeetCode 116.]: https://blog.csdn.net/weixin_38199770/article/details/114402489
[LeetCode 117. _ II]: https://blog.csdn.net/weixin_38199770/article/details/114406403
[Link 5]: https://blog.csdn.net/weixin_38199770/article/details/114626995
[LeetCode 148.]: https://blog.csdn.net/weixin_38199770/article/details/114700924
[Link 6]: https://blog.csdn.net/weixin_38199770/article/details/113777260
[307_1._2._3.]: https://leetcode-cn.com/problems/range-sum-query-mutable/solution/shu-ju-jie-gou-she-ji-zhi-xian-duan-shu-white-rhin/
[307]: https://leetcode-cn.com/problems/range-sum-query-mutable/solution/qu-yu-he-jian-suo-shu-zu-ke-xiu-gai-by-leetcode/
[LeetCode 315.]: https://blog.csdn.net/weixin_38199770/article/details/113762819
[LeetCode 307. _ -]: https://blog.csdn.net/weixin_38199770/article/details/113776683
[LeetCode 327. _]: https://blog.csdn.net/weixin_38199770/article/details/113748066
[LeetCode 493.]: https://blog.csdn.net/weixin_38199770/article/details/113747516
[LeetCode 421.]: https://blog.csdn.net/weixin_38199770/article/details/113818140
[LeetCode 208. _ Trie _]: https://blog.csdn.net/weixin_38199770/article/details/113816411
[LeetCode 211. _ -]: https://blog.csdn.net/weixin_38199770/article/details/113816680
[LeetCode 212. _ II]: https://blog.csdn.net/weixin_38199770/article/details/113817289
[LeetCode 336.]: https://blog.csdn.net/weixin_38199770/article/details/113817832
[LeetCode 11.]: https://blog.csdn.net/weixin_38199770/article/details/113876539
[LeetCode 15.]: https://blog.csdn.net/weixin_38199770/article/details/113876586
[LeetCode 16.]: https://blog.csdn.net/weixin_38199770/article/details/113876762
[LeetCode 18.]: https://blog.csdn.net/weixin_38199770/article/details/113876821
[LeetCode 28. _ strStr]: https://blog.csdn.net/weixin_38199770/article/details/113921951
[LeetCode 30.]: https://blog.csdn.net/weixin_38199770/article/details/113922436
[LeetCode 42.]: https://blog.csdn.net/weixin_38199770/article/details/113922778
[LeetCode 61.]: https://blog.csdn.net/weixin_38199770/article/details/113947557
[LeetCode 75.]: https://blog.csdn.net/weixin_38199770/article/details/113953291
[LeetCode 88.]: https://blog.csdn.net/weixin_38199770/article/details/113959400
[LeetCode 142. _ II]: https://blog.csdn.net/weixin_38199770/article/details/114000993
[LeetCode 234.]: https://blog.csdn.net/weixin_38199770/article/details/114002250
[LeetCode 39.]: https://blog.csdn.net/weixin_38199770/article/details/114040959
[LeetCode 40. _ II]: https://blog.csdn.net/weixin_38199770/article/details/114041758
[LeetCode 47. _ II]: https://blog.csdn.net/weixin_38199770/article/details/114242390
[LeetCode 89.]: https://blog.csdn.net/weixin_38199770/article/details/114294838
[LeetCode 93. _ IP]: https://blog.csdn.net/weixin_38199770/article/details/114296599
[LeetCode 131.]: https://blog.csdn.net/weixin_38199770/article/details/114297091
[Offer 38.]: https://blog.csdn.net/weixin_38199770/article/details/114338395
[Offer 34. _ _ LeetCode 113. _ II]: https://blog.csdn.net/weixin_38199770/article/details/114340693
[Offer 55 - II. _ _ 110.]: https://blog.csdn.net/weixin_38199770/article/details/114342506
[LeetCode 98.]: https://blog.csdn.net/weixin_38199770/article/details/114378121
[LeetCode 109.]: https://blog.csdn.net/weixin_38199770/article/details/114379945
[LeetCode 114.]: https://blog.csdn.net/weixin_38199770/article/details/114380738
[LeetCode 133.]: https://blog.csdn.net/weixin_38199770/article/details/114419276
[LeetCode 448.]: https://blog.csdn.net/weixin_38199770/article/details/113799261
[LeetCode 312.]: https://blog.csdn.net/weixin_38199770/article/details/113759031
[LeetCode 132. _ II]: https://blog.csdn.net/weixin_38199770/article/details/114537106
[LeetCode 338.]: https://blog.csdn.net/weixin_38199770/article/details/114298739