剑指Offer系列刷题笔记汇总

心已赠人 2022-05-31 01:54 188阅读 0赞

本文转自：个人网站：[点击查看][Link 1]

*  一前言
 *  二总结
    
     *  链表-8道
     *  二叉树12道
     *  二叉搜索树3道
     *  数组11道
     *  字符串8道
     *  栈3道
     *  递归4道
     *  回溯法2道
     *  其他15道

# 一、前言 #

本系列文章为《剑指Offer》刷题笔记。  
刷题平台：[牛客网][Link 2]  
书籍下载：[共享资源][Link 3]

刷题刷的比较慢，花费了两个多月，终于将所有题目过了一遍，牛客网一共有66道题，这次刷题主要使用C++，接下来会使用Python重新过一遍，并对这些写过的文章进行更新。同时，也会重新开始刷Leetcode。

# 二、总结 #

现对这66道题目进行了粗略的划分，整理如下：

## 链表-8道： ##

*  [剑指Offer（三）：从尾到头打印链表][Offer]
 *  [剑指Offer（十四）：链表中倒数第k个结点][Offer_k]
 *  [剑指Offer（十五）：反转链表][Offer 1]
 *  [剑指Offer（十六）：合并两个排序的链表][Offer 2]
 *  [剑指Offer（二十五）：复杂链表的复制][Offer 3]
 *  [剑指Offer（三十六）：两个链表的第一个公共结点][Offer 4]
 *  [剑指Offer（五十五）：链表中环的入口结点][Offer 5]
 *  [剑指Offer（五十六）：删除链表中重复的结点][Offer 6]

## 二叉树(12道)： ##

*  [剑指Offer（四）：重建二叉树][Offer 7]
 *  [剑指Offer（十七）：树的子结构][Offer 8]
 *  [剑指Offer（十八）：二叉树的镜像][Offer 9]
 *  [剑指Offer（二十二）：从上往下打印二叉树][Offer 10]
 *  [剑指Offer（二十四）：二叉树中和为某一值的路径][Offer 11]
 *  [剑指Offer（三十八）：二叉树的深度][Offer 12]
 *  [剑指Offer（三十九）：平衡二叉树][Offer 13]
 *  [剑指Offer（五十七）：二叉树的下一个结点][Offer 14]
 *  [剑指Offer（五十八）：对称的二叉树][Offer 15]
 *  [剑指Offer（五十九）：按之字顺序打印二叉树][Offer 16]
 *  [剑指Offer（六十）：把二叉树打印成多行][Offer 17]
 *  [剑指Offer（六十一）：序列化二叉树][Offer 18]

## 二叉搜索树(3道)： ##

*  [剑指Offer（二十三）：二叉搜索树的后序遍历序列][Offer 19]
 *  [剑指Offer（二十六）：二叉搜索树与双向链表][Offer 20]
 *  [剑指Offer（六十二）：二叉搜索树的第k个结点][Offer_k 1]

## 数组(11道)： ##

*  [剑指Offer（一）：二维数组中的查找][Offer 21]
 *  [剑指Offer（六）：旋转数组的最小数字][Offer 22]
 *  [剑指Offer（十三）：调整数组顺序使奇数位于偶数前面][Offer 23]
 *  [剑指Offer（二十八）：数组中出现次数超过一半的数字][Offer 24]
 *  [剑指Offer（三十）：连续子数组的最大和][Offer 25]
 *  [剑指Offer（三十二）：把数组排成最小的数][Offer 26]
 *  [剑指Offer（三十五）：数组中的逆序对][Offer 27]
 *  [剑指Offer（三十七）：数字在排序数组中出现的次数][Offer 28]
 *  [剑指Offer（四十）：数组中只出现一次的数字][Offer 29]
 *  [剑指Offer（五十）：数组中重复的数字][Offer 30]
 *  [剑指Offer（五十一）：构建乘积数组][Offer 31]

## 字符串(8道)： ##

*  [剑指Offer(二)：替换空格][Offer 32]
 *  [剑指Offer（二十七）：字符串的排列][Offer 33]
 *  [剑指Offer（三十四）：第一个只出现一次的字符][Offer 34]
 *  [剑指Offer（四十三）：左旋转字符串][Offer 35]
 *  [剑指Offer（四十四）：翻转单词顺序序列][Offer 36]
 *  [剑指Offer（四十九）：把字符串转换成整数][Offer 37]
 *  [剑指Offer（五十二）：正则表达式匹配][Offer 38]
 *  [剑指Offer（五十三）：表示数值的字符串][Offer 39]

## 栈(3道)： ##

*  [剑指Offer（五）：用两个栈实现队列][Offer 40]
 *  [剑指Offer（二十）：包含min函数的栈][Offer_min]
 *  [剑指Offer（二十一）：栈的压入、弹出序列][Offer 41]

## 递归(4道)： ##

*  [剑指Offer（七）：裴波那契数列][Offer 42]
 *  [剑指Offer（八）：跳台阶][Offer 43]
 *  [剑指Offer（九）：变态跳台阶][Offer 44]
 *  [剑指Offer（十）：矩形覆盖][Offer 45]

## 回溯法(2道)： ##

*  [剑指Offer（六十五）：矩阵中的路径][Offer 46]
 *  [剑指Offer（六十六）：机器人的运动范围][Offer 47]

## 其他(15道)： ##

*  [剑指Offer（十一）：二进制中1的个数][Offer_1]
 *  [剑指Offer（十二）：数值的整数次方][Offer 48]
 *  [剑指Offer（十九）：顺时针打印矩阵][Offer 49]
 *  [剑指Offer（二十九）：最小的K个数][Offer_K]
 *  [剑指Offer（三十一）：整数中1出现的次数（从1到n整数中1出现的次数）][Offer_1_1_n_1]
 *  [剑指Offer（三十三）：丑数][Offer 50]
 *  [剑指Offer（四十一）：和为S的连续正数序列][Offer_S]
 *  [剑指Offer（四十二）：和为S的两个数字][Offer_S 1]
 *  [剑指Offer（四十五）：扑克牌顺子][Offer 51]
 *  [剑指Offer（四十六）：孩子们的游戏（圆圈中最后剩下的数）][Offer 52]
 *  [剑指Offer（四十七）：求1+2+3+…+n][Offer_1_2_3_n]
 *  [剑指Offer（四十八）：不用加减乘除的加法][Offer 53]
 *  [剑指Offer（五十四）：字符流中第一个不重复的字符][Offer 54]
 *  [剑指Offer（六十三）：数据流中的中位数][Offer 55]
 *  [剑指Offer（六十四）：滑动窗口的最大值][Offer 56]

Github项目：[https://github.com/Jack-Cherish/LeetCode][https_github.com_Jack-Cherish_LeetCode]

[Link 1]: http://cuijiahua.com/blog/2018/02/basis_67.html
[Link 2]: https://www.nowcoder.com/ta/coding-interviews?query=&asc=true&order=&page=1
[Link 3]: http://www.cuijiahua.com/resource.html
[Offer]: http://cuijiahua.com/blog/2017/11/basis_3.html
[Offer_k]: http://cuijiahua.com/blog/2017/12/basis_14.html
[Offer 1]: http://cuijiahua.com/blog/2017/12/basis_15.html
[Offer 2]: http://cuijiahua.com/blog/2017/12/basis_16.html
[Offer 3]: http://cuijiahua.com/blog/2017/12/basis_25.html
[Offer 4]: http://cuijiahua.com/blog/2018/01/basis_36.html
[Offer 5]: http://cuijiahua.com/blog/2018/01/basis_55.html
[Offer 6]: http://cuijiahua.com/blog/2018/01/basis_56.html
[Offer 7]: http://cuijiahua.com/blog/2017/11/basis_4.html
[Offer 8]: http://cuijiahua.com/blog/2017/12/basis_17.html
[Offer 9]: http://cuijiahua.com/blog/2017/12/basis_18.html
[Offer 10]: http://cuijiahua.com/blog/2017/12/basis_22.html
[Offer 11]: http://cuijiahua.com/blog/2017/12/basis_24.html
[Offer 12]: http://cuijiahua.com/blog/2018/01/basis_38.html
[Offer 13]: http://cuijiahua.com/blog/2018/01/basis_39.html
[Offer 14]: http://cuijiahua.com/blog/2018/01/basis_57.html
[Offer 15]: http://cuijiahua.com/blog/2018/01/basis_58.html
[Offer 16]: http://cuijiahua.com/blog/2018/01/basis_59.html
[Offer 17]: http://cuijiahua.com/blog/2018/01/basis_60.html
[Offer 18]: http://cuijiahua.com/blog/2018/01/basis_61.html
[Offer 19]: http://cuijiahua.com/blog/2017/12/basis_23.html
[Offer 20]: http://cuijiahua.com/blog/2017/12/basis_26.html
[Offer_k 1]: http://cuijiahua.com/blog/2018/01/basis_62.html
[Offer 21]: http://cuijiahua.com/blog/2017/11/basis_1.html
[Offer 22]: http://cuijiahua.com/blog/2017/11/basis_6.html
[Offer 23]: http://cuijiahua.com/blog/2017/11/basis_13.html
[Offer 24]: http://cuijiahua.com/blog/2017/12/basis_28.html
[Offer 25]: http://cuijiahua.com/blog/2017/12/basis_30.html
[Offer 26]: http://cuijiahua.com/blog/2018/01/basis_32.html
[Offer 27]: http://cuijiahua.com/blog/2018/01/basis_35.html
[Offer 28]: http://cuijiahua.com/blog/2018/01/basis_37.html
[Offer 29]: http://cuijiahua.com/blog/2018/01/basis_40.html
[Offer 30]: http://cuijiahua.com/blog/2018/01/basis_50.html
[Offer 31]: http://cuijiahua.com/blog/2018/01/basis_51.html
[Offer 32]: http://cuijiahua.com/blog/2017/11/basis_2.html
[Offer 33]: http://cuijiahua.com/blog/2017/12/basis_27.html
[Offer 34]: http://cuijiahua.com/blog/2018/01/basis_34.html
[Offer 35]: http://cuijiahua.com/blog/2018/01/basis_43.html
[Offer 36]: http://cuijiahua.com/blog/2018/01/basis_44.html
[Offer 37]: http://cuijiahua.com/blog/2018/01/basis_49.html
[Offer 38]: http://cuijiahua.com/blog/2018/01/basis_52.html
[Offer 39]: http://cuijiahua.com/blog/2018/01/basis_53.html
[Offer 40]: http://cuijiahua.com/blog/2017/11/basis_5.html
[Offer_min]: http://cuijiahua.com/blog/2017/12/basis_20.html
[Offer 41]: http://cuijiahua.com/blog/2017/12/basis_21.html
[Offer 42]: http://cuijiahua.com/blog/2017/11/basis_7.html
[Offer 43]: http://cuijiahua.com/blog/2017/11/basis_8.html
[Offer 44]: http://cuijiahua.com/blog/2017/11/basis_9.html
[Offer 45]: http://cuijiahua.com/blog/2017/11/basis_10.html
[Offer 46]: http://cuijiahua.com/blog/2018/02/basis_65.html
[Offer 47]: http://cuijiahua.com/blog/2018/02/basis_66.html
[Offer_1]: http://cuijiahua.com/blog/2017/11/basis_11.html
[Offer 48]: http://cuijiahua.com/blog/2017/11/basis_12.html
[Offer 49]: http://cuijiahua.com/blog/2017/12/basis_19.html
[Offer_K]: http://cuijiahua.com/blog/2017/12/basis_29.html
[Offer_1_1_n_1]: http://cuijiahua.com/blog/2017/12/basis_31.html
[Offer 50]: http://cuijiahua.com/blog/2018/01/basis_33.html
[Offer_S]: http://cuijiahua.com/blog/2018/01/basis_41.html
[Offer_S 1]: http://cuijiahua.com/blog/2018/01/basis_42.html
[Offer 51]: http://cuijiahua.com/blog/2018/01/basis_45.html
[Offer 52]: http://cuijiahua.com/blog/2018/01/basis_46.html
[Offer_1_2_3_n]: http://cuijiahua.com/blog/2018/01/basis_47.html
[Offer 53]: http://cuijiahua.com/blog/2018/01/basis_48.html
[Offer 54]: http://cuijiahua.com/blog/2018/01/basis_54.html
[Offer 55]: http://cuijiahua.com/blog/2018/02/basis_63.html
[Offer 56]: http://cuijiahua.com/blog/2018/02/basis_64.html
[https_github.com_Jack-Cherish_LeetCode]: https://github.com/Jack-Cherish/LeetCode