【剑指offer】【leetcode精选题集】【Java】剑指offer题解合集更新中

拼搏现实的明天。 2023-03-02 15:58 14阅读 0赞

## Leetcode题集 ##

[\[剑指offer\]\[JAVA\]面试题第\[03\]题\[数组中的重复数字\]\[HashSet\]][offer_JAVA_03_HashSet]  
[\[剑指offer\]\[JAVA\]面试题第\[04\]题\[二维数中的查找\]\[数组\]][offer_JAVA_04]  
[\[剑指offer\]\[JAVA\]面试题第\[05\]题\[替换空格\]\[StringBuilder/Buffer\]][offer_JAVA_05_StringBuilder_Buffer]  
[\[剑指offer\]\[JAVA\]面试题第\[06\]题\[从尾到头打印链表\]\[栈\]\[递归\]][offer_JAVA_06]  
[\[剑指offer\]\[JAVA\]面试题第\[07\]题\[重建二叉树\]\[递归\]][offer_JAVA_07]  
[\[剑指offer\]\[JAVA\]面试题第\[09\]题\[用两个栈实现队列\]\[LinkedList\]][offer_JAVA_09_LinkedList]  
[\[剑指offer\]\[JAVA\]面试题第\[10-1\]题\[斐波那契数列\]\[动态规划\]\[记忆化递归\]][offer_JAVA_10-1]  
[\[剑指offer\]\[JAVA\]面试题第\[10-2\]题\[青蛙跳台阶问题\]\[动态规划\]\[递归\]][offer_JAVA_10-2]  
[\[剑指offer\]\[JAVA\]面试题第\[11\]题\[旋转数组的最小数字\]\[二分法\]\[分治\]][offer_JAVA_11]  
[\[剑指offer\]\[JAVA\]面试题第\[12\]题\[矩阵的路径\]\[DFS\]\[剪枝\]][offer_JAVA_12_DFS]  
[\[剑指offer\]\[JAVA\]\[面试题第13题\]\[机器人的运动\]\[DFS\]\[BFS\]][offer_JAVA_13_DFS_BFS]  
[\[剑指offer\]\[JAVA\]面试题第\[14-1、2\]题\[剪绳子\]\[数学\]\[动态规划\]\[背包\]][offer_JAVA_14-1_2]  
[\[剑指offer\]\[JAVA\]面试题第\[15\]题\[二进制中1的个数\]\[位运算\]][offer_JAVA_15_1]  
[\[剑指offer\]\[JAVA\]面试题第\[16\]题\[数值的整数次方\]\[位运算\]\[二分法\]][offer_JAVA_16]  
[\[剑指offer\]\[JAVA\]面试题第\[17\]题\[打印从1到最大的n位整数\]\[大整数\]\[递归回溯\]][offer_JAVA_17_1_n]  
[\[剑指offer\]\[JAVA\]面试题第\[18\]题\[删除链表的节点\]][offer_JAVA_18]  
[\[剑指offer\]面试题第\[19\]题\[正则表达式\]\[动态规划\]\[递归\]\[JAVA\]][offer_19_JAVA]  
[\[剑指offer\]\[JAVA\]面试题第\[20\]题\[表示数值的字符串\]\[状态机\]][offer_JAVA_20]  
[\[剑指offer\]\[JAVA\]面试题第\[21\]题\[调整数组顺序使奇数位于偶数面前\]\[双指针\]][offer_JAVA_21]  
[\[剑指offer\]\[JAVA\]面试题第\[22\]题\[j剑指offer\]\[双指针\]\[快慢指针\]][offer_JAVA_22_j_offer]  
[\[剑指offer\]\[JAVA\]面试题\[第23题\]\[合并K个排序链表\]\[分治\]\[优先队列\]][offer_JAVA_23_K]  
[\[剑指offer\]\[JAVA\]面试题第\[24\]题\[反转链表\]\[递归\]\[双指针\]\[头插法\]][offer_JAVA_24]  
[\[剑指offer\]面试题第\[25\]题\[Leedcode\]\[JAVA\]\[第21题\]\[合并两个有序链表\]][offer_25_Leedcode_JAVA_21]  
[\[剑指offer\]\[JAVA\]面试题第\[26\]题\[树的子结构\]\[递归\]][offer_JAVA_26]  
[\[剑指offer\]\[JAVA\]面试题第\[27\]题\[二叉树的镜像\]\[递归\]\[栈\]][offer_JAVA_27]  
[\[剑指offer\]面试题第\[28\]题\[Leedcode\]\[JAVA\]\[第101题\]\[对称二叉树\]\[队列\]\[递归\]][offer_28_Leedcode_JAVA_101]  
[\[剑指offer\]\[JAVA\]面试题第\[29\]题\[顺时针打印矩阵\]\[数组\]][offer_JAVA_29]  
[\[剑指offer\]\[JAVA\]面试题第\[30\]题\[包含min函数的栈\]\[双栈辅助栈\]\[单栈\]][offer_JAVA_30_min]  
[\[剑指offer\]\[JAVA\]面试题第\[31\]题\[栈的压入、弹出序列\]\[栈\]][offer_JAVA_31]  
[\[剑指offer\]\[JAVA\]面试题第\[32-1\]题\[从上到下打印二叉树\]\[BFS\]][offer_JAVA_32-1_BFS]  
[\[剑指offer\]\[JAVA\]面试题第\[32-2\]题\[从上到下打印二叉树\]\[BFS\]][offer_JAVA_32-2_BFS]  
[\[剑指offer\]\[JAVA\]面试题第\[32-3\]题\[从上到下打印二叉树 \]\[BFS\]][offer_JAVA_32-3_ _BFS]  
[\[剑指offer\]\[JAVA\]面试题第\[33\]题\[二叉搜索树的后序遍历\]\[单调栈\]\[递归分治\]][offer_JAVA_33]  
[\[剑指offer\]\[JAVA\]面试题第\[34\]题\[二叉树中和为某一值的路径\]\[回溯\]][offer_JAVA_34]  
[\[剑指offer\]面试题第\[35\]题\[Leetcode\]\[第138题\]\[JAVA\]\[复杂链表的复制\]\[暴力\]\[HashMap\]\[复制链表\]][offer_35_Leetcode_138_JAVA_HashMap]  
[\[剑指offer\]面试题第\[36\]题\[JAVA\]\[二叉搜索树与双向链表\]\[递归\]][offer_36_JAVA]  
[\[剑指offer\]面试题第\[37\]题\[Leedcode\]\[JAVA\]\[第297题\]\[二叉树列的序列化与反序列化\]\[递归\]\[BFS\]][offer_37_Leedcode_JAVA_297_BFS]  
[\[剑指offer\]面试题第\[38\]题\[JAVA\]\[字符串的排列\]\[回溯法\]][offer_38_JAVA]  
[\[剑指offer\]\[JAVA\]面试题第\[39\]题\[数组中出现次数超过一半的数字\]\[HashMap\]\[摩尔投票法\]][offer_JAVA_39_HashMap]  
[\[剑指offer\]\[JAVA\]\[面试第40题\]\[最小的k个数\]\[快选\]\[堆\]\[BST\]][offer_JAVA_40_k_BST]  
[\[剑指offer\]面试题第\[41\]题\[Leetcode\]\[第235题\]\[JAVA\]\[数据流中的中位数\]\[优先队列\]\[堆\]][offer_41_Leetcode_235_JAVA]  
[\[剑指offer\]面试题第\[42\]题\[Leedcode\]\[JAVA\]\[第53题\]\[最大子序和\]\[动态规划\]\[贪心\]\[分治\]][offer_42_Leedcode_JAVA_53]  
[\[剑指offer\]面试题第\[43\]题\[Leetcode\]\[第233题\]\[JAVA\]\[1～n整数中1出现的次数\]\[找规律\]\[递归\]][offer_43_Leetcode_233_JAVA_1_n_1]  
[\[剑指offer\]面试题第\[44\]题\[JAVA\]\[数字序列中某一位的数字\]\[找规律\]][offer_44_JAVA]  
[\[剑指offer\]面试题第\[45\]题\[JAVA\]\[把数组排成最小的数\]\[快排\]\[ Comparator\]\[PriorityQueue\]][offer_45_JAVA_ Comparator_PriorityQueue]  
[\[剑指offer\]\[JAVA\]面试题第\[46\]题\[把数字翻译成字符串\]\[递归\]\[逆推\]][offer_JAVA_46]  
[\[剑指offer\]面试题第\[47\]题\[JAVA\]\[礼物的最大价值\]\[动态规划\]][offer_47_JAVA]  
[\[剑指offer\]面试题第\[48\]题\[Leetcode\]\[JAVA\]\[第3题\]\[无重复字符的最长字串\]\[滑动窗口\]\[HashSet/Map\]][offer_48_Leetcode_JAVA_3_HashSet_Map]  
[\[剑指offer\]面试题第\[49\]题\[Leetcode\]\[第264题\]\[JAVA\]\[丑数\]\[动态规划\]\[堆\]][offer_49_Leetcode_264_JAVA]  
[\[剑指offer\]面试题第\[50\]题\[JAVA\]\[第一个只出现一次的字符\]\[哈希表\]\[HashMap\]][offer_50_JAVA_HashMap]  
[\[剑指offer\]\[JAVA\]面试题\[51\]\[数组中的逆序对\]\[归并排序\]][offer_JAVA_51]  
[\[剑指offer\]面试题第\[52\]题\[Leedcode\]\[第160题\]\[JAVA\]\[相交链表\]\[双指针\]][offer_52_Leedcode_160_JAVA]  
[\[剑指offer\]面试题第\[53-1\]题\[JAVA\]\[在排序数组中查找数字-1\]\[二分法\]\[暴力法\]][offer_53-1_JAVA_-1]  
[\[剑指offer\]面试题第\[53-2\]题\[JAVA\]\[0-n-1中缺失的数字\]\[二分法\]\[暴力法\]][offer_53-2_JAVA_0-n-1]  
[\[剑指offer\]面试题第\[54\]题\[JAVA\]\[二叉搜索树的第k大节点\]\[递归\]\[迭代\]][offer_54_JAVA_k]  
[\[剑指offer\]面试题第\[55-1\]题\[JAVA\]\[二叉树的深度\]\[BFS\]\[DFS\]][offer_55-1_JAVA_BFS_DFS]  
[\[剑指offer\]面试题第\[55-2\]题\[Leetcode\]\[第110题\]\[JAVA\]\[平衡二叉树\]\[DFS\]\[剪枝\]][offer_55-2_Leetcode_110_JAVA_DFS]  
[\[剑指offer\]\[JAVA\]\[面试题56 - I\]\[第260题\]\[位运算\]\[HashSet\]][offer_JAVA_56 - I_260_HashSet]  
[\[剑指offer\]面试题第\[56-2\]题\[JAVA\]\[数组中数字出现的次数\]\[状态机\]\[hashmap\]\[位运算\]][offer_56-2_JAVA_hashmap]  
[\[剑指offer\]面试题第\[57\]题\[Leetcode\]\[第167题\]\[JAVA\]\[和为s的两个数字\]\[两数之和\]\[HashSet\]\[二分\]\[双指针\]][offer_57_Leetcode_167_JAVA_s_HashSet]  
[\[剑指offer\]面试题第\[57-2\]题\[JAVA\]\[和为s的连续正数序列\]\[数学法\]\[滑动窗口\]][offer_57-2_JAVA_s]  
[\[剑指offer\]面试题第\[58\]题\[Leetcode\]\[JAVA\]\[第151题\]\[翻转单词\]\[字符串常用函数总结\]][offer_58_Leetcode_JAVA_151]  
[\[剑指offer\]面试题第\[58-2\]题\[JAVA\]\[左旋转字符串\]\[拼接\]][offer_58-2_JAVA]  
[\[剑指offer\]面试题第\[59-1\]题\[Leetcode\]\[第239题\]\[JAVA\]\[滑动窗口的最大值\]\[单调队列\]\[优先队列\]][offer_59-1_Leetcode_239_JAVA]  
[\[剑指offer\]面试题第\[59-2\]题\[JAVA\]\[队列的最大值\]\[暴力\]\[双端队列\]][offer_59-2_JAVA]  
[\[剑指offer\]面试题第\[60\]题\[JAVA\]\[n个骰子的点数\]\[动态规划\]\[空间优化\]][offer_60_JAVA_n]  
[\[剑指offer\]面试题第\[61\]题\[JAVA\]\[扑克牌中的点数\]\[HashSet\]\[数组\]][offer_61_JAVA_HashSet]  
[\[剑指offer\]\[JAVA\]\[第62题\]\[约瑟夫环\]\[LinkedList vs ArrayList\]][offer_JAVA_62_LinkedList vs ArrayList]  
[\[剑指offer\]面试题第\[63\]题\[Leetcode\]\[第121题\]\[JAVA\]\[买卖股票的最佳时机\]\[动态规划\]\[暴力\]][offer_63_Leetcode_121_JAVA]  
[\[剑指offer\]\[JAVA\]面试题第\[64\]题\[求1+2+…+n\]\[逻辑运算符\]][offer_JAVA_64_1_2_n]  
[\[剑指offer\]面试题第\[65\]题\[JAVA\]\[不用加减乘除做加法\]\[位运算\]][offer_65_JAVA]  
[\[剑指offer\]面试题第\[66\]题\[构建乘积数组\]\[Leetcode\]\[JAVA\]\[第238题\]\[除自身以外数组的乘积\]\[数组\]][offer_66_Leetcode_JAVA_238]  
[\[剑指offer\]面试题第\[67\]题\[Leetcode\]\[JAVA\]\[第8题\] 字符串转换整数 (atoi)\[字符串\]][offer_67_Leetcode_JAVA_8_ _ _atoi]  
[\[剑指offer\]面试题第\[68-1\]题\[Leedcode\]\[JAVA\]\[第235题\]\[二叉搜索树的最近公共祖先\]\[递归\]\[BFS\]][offer_68-1_Leedcode_JAVA_235_BFS]  
[\[剑指offer\]面试题第\[68-2\]题\[Leetcode\]\[第236题\]\[JAVA\]\[二叉搜索树的最近公共祖先\]\[递归\]][offer_68-2_Leetcode_236_JAVA]

## 牛客网 题集 ##

[\[剑指offer\]面试题第\[1\]题\[JAVA\]\[二维数组中的查找\]\[数组\]\[二分\]][offer_1_JAVA]  
[\[剑指offer\]面试题第\[2\]题\[JAVA\]\[替换空格\]\[函数\]\[字符串\]][offer_2_JAVA]  
[\[剑指offer\]面试题第\[3\]题\[JAVA\]\[从尾到头打印链表\]\[栈\]][offer_3_JAVA]  
[\[剑指offer\]面试题第\[6\]题\[JAVA\]\[旋转数组的最小数字\]\[二分法\]][offer_6_JAVA]  
[\[剑指offer\]面试题第\[7\]题\[JAVA\]\[斐波那契数列\]\[递归\]][offer_7_JAVA]

[offer_JAVA_03_HashSet]: https://blog.csdn.net/dadongwudi/article/details/106389782
[offer_JAVA_04]: https://blog.csdn.net/dadongwudi/article/details/106390317
[offer_JAVA_05_StringBuilder_Buffer]: https://blog.csdn.net/dadongwudi/article/details/106415707
[offer_JAVA_06]: https://blog.csdn.net/dadongwudi/article/details/106416004
[offer_JAVA_07]: https://blog.csdn.net/dadongwudi/article/details/106435311
[offer_JAVA_09_LinkedList]: https://blog.csdn.net/dadongwudi/article/details/106478719
[offer_JAVA_10-1]: https://blog.csdn.net/dadongwudi/article/details/106480117
[offer_JAVA_10-2]: https://blog.csdn.net/dadongwudi/article/details/106490545
[offer_JAVA_11]: https://blog.csdn.net/dadongwudi/article/details/106491529
[offer_JAVA_12_DFS]: https://blog.csdn.net/dadongwudi/article/details/106521776
[offer_JAVA_13_DFS_BFS]: https://blog.csdn.net/dadongwudi/article/details/105383953
[offer_JAVA_14-1_2]: https://blog.csdn.net/dadongwudi/article/details/106549617
[offer_JAVA_15_1]: https://blog.csdn.net/dadongwudi/article/details/106628076
[offer_JAVA_16]: https://blog.csdn.net/dadongwudi/article/details/106630836
[offer_JAVA_17_1_n]: https://blog.csdn.net/dadongwudi/article/details/106654164
[offer_JAVA_18]: https://blog.csdn.net/dadongwudi/article/details/106653906
[offer_19_JAVA]: https://blog.csdn.net/dadongwudi/article/details/106673448
[offer_JAVA_20]: https://blog.csdn.net/dadongwudi/article/details/106691494
[offer_JAVA_21]: https://blog.csdn.net/dadongwudi/article/details/106699006
[offer_JAVA_22_j_offer]: https://blog.csdn.net/dadongwudi/article/details/106720260
[offer_JAVA_23_K]: https://blog.csdn.net/dadongwudi/article/details/105517489
[offer_JAVA_24]: https://blog.csdn.net/dadongwudi/article/details/106740366
[offer_25_Leedcode_JAVA_21]: https://blog.csdn.net/dadongwudi/article/details/105888647
[offer_JAVA_26]: https://blog.csdn.net/dadongwudi/article/details/106782805
[offer_JAVA_27]: https://blog.csdn.net/dadongwudi/article/details/106800667
[offer_28_Leedcode_JAVA_101]: https://blog.csdn.net/dadongwudi/article/details/106453501
[offer_JAVA_29]: https://blog.csdn.net/dadongwudi/article/details/106566827
[offer_JAVA_30_min]: https://blog.csdn.net/dadongwudi/article/details/106883512
[offer_JAVA_31]: https://blog.csdn.net/dadongwudi/article/details/106898363
[offer_JAVA_32-1_BFS]: https://blog.csdn.net/dadongwudi/article/details/106919962
[offer_JAVA_32-2_BFS]: https://blog.csdn.net/dadongwudi/article/details/106940031
[offer_JAVA_32-3_ _BFS]: https://blog.csdn.net/dadongwudi/article/details/106940630
[offer_JAVA_33]: https://blog.csdn.net/dadongwudi/article/details/106956180
[offer_JAVA_34]: https://blog.csdn.net/dadongwudi/article/details/106969071
[offer_35_Leetcode_138_JAVA_HashMap]: https://blog.csdn.net/dadongwudi/article/details/107531081
[offer_36_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107536879
[offer_37_Leedcode_JAVA_297_BFS]: https://blog.csdn.net/dadongwudi/article/details/106781050
[offer_38_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107037893
[offer_JAVA_39_HashMap]: https://blog.csdn.net/dadongwudi/article/details/106980790
[offer_JAVA_40_k_BST]: https://blog.csdn.net/dadongwudi/article/details/105533918
[offer_41_Leetcode_235_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107512494
[offer_42_Leedcode_JAVA_53]: https://blog.csdn.net/dadongwudi/article/details/105934671
[offer_43_Leetcode_233_JAVA_1_n_1]: https://blog.csdn.net/dadongwudi/article/details/107203963
[offer_44_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107508877
[offer_45_JAVA_ Comparator_PriorityQueue]: https://blog.csdn.net/dadongwudi/article/details/107492012
[offer_JAVA_46]: https://blog.csdn.net/dadongwudi/article/details/106647818
[offer_47_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107484532
[offer_48_Leetcode_JAVA_3_HashSet_Map]: https://blog.csdn.net/dadongwudi/article/details/105888229
[offer_49_Leetcode_264_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107427104
[offer_50_JAVA_HashMap]: https://blog.csdn.net/dadongwudi/article/details/107017492
[offer_JAVA_51]: https://blog.csdn.net/dadongwudi/article/details/105739178
[offer_52_Leedcode_160_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107039198
[offer_53-1_JAVA_-1]: https://blog.csdn.net/dadongwudi/article/details/107059615
[offer_53-2_JAVA_0-n-1]: https://blog.csdn.net/dadongwudi/article/details/107062173
[offer_54_JAVA_k]: https://blog.csdn.net/dadongwudi/article/details/107090359
[offer_55-1_JAVA_BFS_DFS]: https://blog.csdn.net/dadongwudi/article/details/107101565
[offer_55-2_Leetcode_110_JAVA_DFS]: https://blog.csdn.net/dadongwudi/article/details/107103904
[offer_JAVA_56 - I_260_HashSet]: https://blog.csdn.net/dadongwudi/article/details/105810930
[offer_56-2_JAVA_hashmap]: https://blog.csdn.net/dadongwudi/article/details/107122512
[offer_57_Leetcode_167_JAVA_s_HashSet]: https://blog.csdn.net/dadongwudi/article/details/107138166
[offer_57-2_JAVA_s]: https://blog.csdn.net/dadongwudi/article/details/107153533
[offer_58_Leetcode_JAVA_151]: https://blog.csdn.net/dadongwudi/article/details/105454134
[offer_58-2_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107318472
[offer_59-1_Leetcode_239_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107320848
[offer_59-2_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107334228
[offer_60_JAVA_n]: https://blog.csdn.net/dadongwudi/article/details/107338746
[offer_61_JAVA_HashSet]: https://blog.csdn.net/dadongwudi/article/details/107353782
[offer_JAVA_62_LinkedList vs ArrayList]: https://blog.csdn.net/dadongwudi/article/details/105212994
[offer_63_Leetcode_121_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107247258
[offer_JAVA_64_1_2_n]: https://blog.csdn.net/dadongwudi/article/details/106489555
[offer_65_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107354481
[offer_66_Leetcode_JAVA_238]: https://blog.csdn.net/dadongwudi/article/details/106555191
[offer_67_Leetcode_JAVA_8_ _ _atoi]: https://blog.csdn.net/dadongwudi/article/details/105297096
[offer_68-1_Leedcode_JAVA_235_BFS]: https://blog.csdn.net/dadongwudi/article/details/106037304
[offer_68-2_Leetcode_236_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107377419
[offer_1_JAVA]: https://blog.csdn.net/dadongwudi/article/details/107679463
[offer_2_JAVA]: https://blog.csdn.net/dadongwudi/article/details/104932674
[offer_3_JAVA]: https://blog.csdn.net/dadongwudi/article/details/104952907
[offer_6_JAVA]: https://blog.csdn.net/dadongwudi/article/details/104979880
[offer_7_JAVA]: https://blog.csdn.net/dadongwudi/article/details/105039630