本文转自:个人网站:点击查看 <http://cuijiahua.com/blog/2018/02/basis_67.html>



* 一前言 <https://blog.csdn.net/c406495762/article/details/79247243#一前言>
* 二总结 <https://blog.csdn.net/c406495762/article/details/79247243#二总结>
* 链表-8道 <https://blog.csdn.net/c406495762/article/details/79247243#链表-8道>
* 二叉树12道 <https://blog.csdn.net/c406495762/article/details/79247243#二叉树12道>
* 二叉搜索树3道 <https://blog.csdn.net/c406495762/article/details/79247243#二叉搜索树3道>
* 数组11道 <https://blog.csdn.net/c406495762/article/details/79247243#数组11道>
* 字符串8道 <https://blog.csdn.net/c406495762/article/details/79247243#字符串8道>
* 栈3道 <https://blog.csdn.net/c406495762/article/details/79247243#栈3道>
* 递归4道 <https://blog.csdn.net/c406495762/article/details/79247243#递归4道>
* 回溯法2道 <https://blog.csdn.net/c406495762/article/details/79247243#回溯法2道>
* 其他15道 <https://blog.csdn.net/c406495762/article/details/79247243#其他15道>


一、前言

本系列文章为《剑指Offer》刷题笔记。
刷题平台:牛客网
<https://www.nowcoder.com/ta/coding-interviews?query=&asc=true&order=&page=1>
书籍下载:共享资源 <http://www.cuijiahua.com/resource.html>


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

二、总结

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

链表-8道:

* 剑指Offer(三):从尾到头打印链表 <http://cuijiahua.com/blog/2017/11/basis_3.html>
* 剑指Offer(十四):链表中倒数第k个结点 <http://cuijiahua.com/blog/2017/12/basis_14.html>
* 剑指Offer(十五):反转链表 <http://cuijiahua.com/blog/2017/12/basis_15.html>
* 剑指Offer(十六):合并两个排序的链表 <http://cuijiahua.com/blog/2017/12/basis_16.html>
* 剑指Offer(二十五):复杂链表的复制 <http://cuijiahua.com/blog/2017/12/basis_25.html>
* 剑指Offer(三十六):两个链表的第一个公共结点 <http://cuijiahua.com/blog/2018/01/basis_36.html>
* 剑指Offer(五十五):链表中环的入口结点 <http://cuijiahua.com/blog/2018/01/basis_55.html>
* 剑指Offer(五十六):删除链表中重复的结点 <http://cuijiahua.com/blog/2018/01/basis_56.html>
二叉树(12道):

* 剑指Offer(四):重建二叉树 <http://cuijiahua.com/blog/2017/11/basis_4.html>
* 剑指Offer(十七):树的子结构 <http://cuijiahua.com/blog/2017/12/basis_17.html>
* 剑指Offer(十八):二叉树的镜像 <http://cuijiahua.com/blog/2017/12/basis_18.html>
* 剑指Offer(二十二):从上往下打印二叉树 <http://cuijiahua.com/blog/2017/12/basis_22.html>
* 剑指Offer(二十四):二叉树中和为某一值的路径 <http://cuijiahua.com/blog/2017/12/basis_24.html>
* 剑指Offer(三十八):二叉树的深度 <http://cuijiahua.com/blog/2018/01/basis_38.html>
* 剑指Offer(三十九):平衡二叉树 <http://cuijiahua.com/blog/2018/01/basis_39.html>
* 剑指Offer(五十七):二叉树的下一个结点 <http://cuijiahua.com/blog/2018/01/basis_57.html>
* 剑指Offer(五十八):对称的二叉树 <http://cuijiahua.com/blog/2018/01/basis_58.html>
* 剑指Offer(五十九):按之字顺序打印二叉树 <http://cuijiahua.com/blog/2018/01/basis_59.html>
* 剑指Offer(六十):把二叉树打印成多行 <http://cuijiahua.com/blog/2018/01/basis_60.html>
* 剑指Offer(六十一):序列化二叉树 <http://cuijiahua.com/blog/2018/01/basis_61.html>
二叉搜索树(3道):

* 剑指Offer(二十三):二叉搜索树的后序遍历序列 <http://cuijiahua.com/blog/2017/12/basis_23.html>
* 剑指Offer(二十六):二叉搜索树与双向链表 <http://cuijiahua.com/blog/2017/12/basis_26.html>
* 剑指Offer(六十二):二叉搜索树的第k个结点 <http://cuijiahua.com/blog/2018/01/basis_62.html>
数组(11道):

* 剑指Offer(一):二维数组中的查找 <http://cuijiahua.com/blog/2017/11/basis_1.html>
* 剑指Offer(六):旋转数组的最小数字 <http://cuijiahua.com/blog/2017/11/basis_6.html>
* 剑指Offer(十三):调整数组顺序使奇数位于偶数前面
<http://cuijiahua.com/blog/2017/11/basis_13.html>
* 剑指Offer(二十八):数组中出现次数超过一半的数字
<http://cuijiahua.com/blog/2017/12/basis_28.html>
* 剑指Offer(三十):连续子数组的最大和 <http://cuijiahua.com/blog/2017/12/basis_30.html>
* 剑指Offer(三十二):把数组排成最小的数 <http://cuijiahua.com/blog/2018/01/basis_32.html>
* 剑指Offer(三十五):数组中的逆序对 <http://cuijiahua.com/blog/2018/01/basis_35.html>
* 剑指Offer(三十七):数字在排序数组中出现的次数 <http://cuijiahua.com/blog/2018/01/basis_37.html>
* 剑指Offer(四十):数组中只出现一次的数字 <http://cuijiahua.com/blog/2018/01/basis_40.html>
* 剑指Offer(五十):数组中重复的数字 <http://cuijiahua.com/blog/2018/01/basis_50.html>
* 剑指Offer(五十一):构建乘积数组 <http://cuijiahua.com/blog/2018/01/basis_51.html>
字符串(8道):

* 剑指Offer(二):替换空格 <http://cuijiahua.com/blog/2017/11/basis_2.html>
* 剑指Offer(二十七):字符串的排列 <http://cuijiahua.com/blog/2017/12/basis_27.html>
* 剑指Offer(三十四):第一个只出现一次的字符 <http://cuijiahua.com/blog/2018/01/basis_34.html>
* 剑指Offer(四十三):左旋转字符串 <http://cuijiahua.com/blog/2018/01/basis_43.html>
* 剑指Offer(四十四):翻转单词顺序序列 <http://cuijiahua.com/blog/2018/01/basis_44.html>
* 剑指Offer(四十九):把字符串转换成整数 <http://cuijiahua.com/blog/2018/01/basis_49.html>
* 剑指Offer(五十二):正则表达式匹配 <http://cuijiahua.com/blog/2018/01/basis_52.html>
* 剑指Offer(五十三):表示数值的字符串 <http://cuijiahua.com/blog/2018/01/basis_53.html>
栈(3道):

* 剑指Offer(五):用两个栈实现队列 <http://cuijiahua.com/blog/2017/11/basis_5.html>
* 剑指Offer(二十):包含min函数的栈 <http://cuijiahua.com/blog/2017/12/basis_20.html>
* 剑指Offer(二十一):栈的压入、弹出序列 <http://cuijiahua.com/blog/2017/12/basis_21.html>
递归(4道):

* 剑指Offer(七):裴波那契数列 <http://cuijiahua.com/blog/2017/11/basis_7.html>
* 剑指Offer(八):跳台阶 <http://cuijiahua.com/blog/2017/11/basis_8.html>
* 剑指Offer(九):变态跳台阶 <http://cuijiahua.com/blog/2017/11/basis_9.html>
* 剑指Offer(十):矩形覆盖 <http://cuijiahua.com/blog/2017/11/basis_10.html>
回溯法(2道):

* 剑指Offer(六十五):矩阵中的路径 <http://cuijiahua.com/blog/2018/02/basis_65.html>
* 剑指Offer(六十六):机器人的运动范围 <http://cuijiahua.com/blog/2018/02/basis_66.html>
其他(15道):

* 剑指Offer(十一):二进制中1的个数 <http://cuijiahua.com/blog/2017/11/basis_11.html>
* 剑指Offer(十二):数值的整数次方 <http://cuijiahua.com/blog/2017/11/basis_12.html>
* 剑指Offer(十九):顺时针打印矩阵 <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(三十三):丑数 <http://cuijiahua.com/blog/2018/01/basis_33.html>
* 剑指Offer(四十一):和为S的连续正数序列 <http://cuijiahua.com/blog/2018/01/basis_41.html>
* 剑指Offer(四十二):和为S的两个数字 <http://cuijiahua.com/blog/2018/01/basis_42.html>
* 剑指Offer(四十五):扑克牌顺子 <http://cuijiahua.com/blog/2018/01/basis_45.html>
* 剑指Offer(四十六):孩子们的游戏(圆圈中最后剩下的数)
<http://cuijiahua.com/blog/2018/01/basis_46.html>
* 剑指Offer(四十七):求1+2+3+…+n <http://cuijiahua.com/blog/2018/01/basis_47.html>
* 剑指Offer(四十八):不用加减乘除的加法 <http://cuijiahua.com/blog/2018/01/basis_48.html>
* 剑指Offer(五十四):字符流中第一个不重复的字符 <http://cuijiahua.com/blog/2018/01/basis_54.html>
* 剑指Offer(六十三):数据流中的中位数 <http://cuijiahua.com/blog/2018/02/basis_63.html>
* 剑指Offer(六十四):滑动窗口的最大值 <http://cuijiahua.com/blog/2018/02/basis_64.html>
Github项目:https://github.com/Jack-Cherish/LeetCode
<https://github.com/Jack-Cherish/LeetCode>