---
title: 剑指offer
categories:
- 其他
---

牛客网剑指 Offer 刷题题解
========

### tooffer 


| # | Title | Solution | type |
|---| ----- | -------- | ---------- |
|1|[二维数组中的查找](https://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e?tpId=13&tqId=11154&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T1.java)|数组|
|2|[替换空格](https://www.nowcoder.com/practice/4060ac7e3e404ad1a894ef3e17650423?tpId=13&tqId=11155&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T2.java)|字符串|
|3|[从尾到头打印链表](https://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035?tpId=13&tqId=11156&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T3.java)|链表|
|4|[重建二叉树](https://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6?tpId=13&tqId=11157&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T4.java)|树|
|5|[用两个栈实现队列](https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6?tpId=13&tqId=11158&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T5.java)|队列和栈|
|6|[旋转数组的最小数字](https://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba?tpId=13&tqId=11159&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T6.java)|查找和排序|
|7|[斐波拉契数列](https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T7.java)|递归和循环|
|8|[跳台阶](https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4?tpId=13&tqId=11161&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T8.java)|递归和循环|
|9|[变态跳台阶](https://www.nowcoder.com/practice/22243d016f6b47f2a6928b4313c85387?tpId=13&tqId=11162&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T9.java)|递归和循环|
|10|[矩形覆盖](https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=13&tqId=11163&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T10.java)|递归和循环|
|11|[二进制中1的个数](https://www.nowcoder.com/practice/8ee967e43c2c4ec193b040ea7fbb10b8?tpId=13&tqId=11164&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T11.java)|位运算|
|12|[数值的整数次方](https://www.nowcoder.com/practice/1a834e5e3e1a4b7ba251417554e07c00?tpId=13&tqId=11165&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T12.java)|代码的完整性|
|13|[调整数组顺序使奇数为于偶数前面](https://www.nowcoder.com/practice/beb5aa231adc45b2a5dcc5b62c93f593?tpId=13&tqId=11166&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T13.java)|代码的完整性|
|14|[链表中倒数第k个结点](https://www.nowcoder.com/practice/529d3ae5a407492994ad2a246518148a?tpId=13&tqId=11167&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T14.java)|代码的鲁棒性|
|15|[反转链表](https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=13&tqId=11168&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T15.java)|代码的鲁棒性|
|16|[合并两个排序的链表](https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&tqId=11169&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T16.java)|代码的鲁棒性|
|17|[树的子结构](https://www.nowcoder.com/practice/6e196c44c7004d15b1610b9afca8bd88?tpId=13&tqId=11170&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T17.java)|代码的鲁棒性|
|18|[二叉树的镜像](https://www.nowcoder.com/practice/564f4c26aa584921bc75623e48ca3011?tpId=13&tqId=11171&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T18.java)|面试思路|
|19|[顺时针打印矩阵](https://www.nowcoder.com/practice/9b4c81a02cd34f76be2659fa0d54342a?tpId=13&tqId=11172&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T19.java)|画图让抽象形象化|
|20|[包含min函数的栈](https://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49?tpId=13&tqId=11173&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T20.java)|举例让抽象具体化|
|21|[栈的压入、弹出序列](https://www.nowcoder.com/practice/d77d11405cc7470d82554cb392585106?tpId=13&tqId=11174&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T21.java)|举例让抽象具体化|
|22|[从上往下打印二叉树](https://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701?tpId=13&tqId=11175&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T22.java)|举例让抽象具体化|
|23|[二叉搜索树的后序遍历序列](https://www.nowcoder.com/practice/a861533d45854474ac791d90e447bafd?tpId=13&tqId=11176&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T23.java)|举例让抽象具体化|
|24|[二叉树中和为某一值的路径](https://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tqId=11177&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T24.java)|举例让抽象具体化|
|25|[复杂链表的复制](https://www.nowcoder.com/practice/f836b2c43afc4b35ad6adc41ec941dba?tpId=13&tqId=11178&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T25.java)|分解让复杂问题简单|
|26|[二叉搜索树与双向链表](https://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5?tpId=13&tqId=11179&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T26.java)|分解让复杂问题简单|
|27|[字符串的排列](https://www.nowcoder.com/practice/fe6b651b66ae47d7acce78ffdd9a96c7?tpId=13&tqId=11180&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T27.java)|分解让复杂问题简单|
|28|[数组中出现次数超过一半的数字](https://www.nowcoder.com/practice/e8a1b01a2df14cb2b228b30ee6a92163?tpId=13&tqId=11181&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T28.java)|时间效率|
|29|[最小的K个数](https://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf?tpId=13&tqId=11182&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T29.java)|时间效率|
|30|[连续子序列的最大和](https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484?tpId=13&tqId=11183&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T30.java)|时间效率|
|31|[整数中1出现的次数（从1到n整数中1出现的次数）](https://www.nowcoder.com/practice/bd7f978302044eee894445e244c7eee6?tpId=13&tqId=11184&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T31.java)|时间效率|
|32|[把数组排成最小的数](https://www.nowcoder.com/practice/8fecd3f8ba334add803bf2a06af1b993?tpId=13&tqId=11185&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T32.java)|时间效率|
|33|[丑数](https://www.nowcoder.com/practice/6aa9e04fc3794f68acf8778237ba065b?tpId=13&tqId=11186&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T33.java)|时间空间效率的平衡|
|34|[第一次只出现一次的字符位置](https://www.nowcoder.com/practice/1c82e8cf713b4bbeb2a5b31cf5b0417c?tpId=13&tqId=11187&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T34.java)|时间空间效率的平衡|
|35|[数组中的逆序对](https://www.nowcoder.com/practice/96bd6684e04a44eb80e6a68efc0ec6c5?tpId=13&tqId=11188&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T35.java)|时间空间效率的平衡|
|36|[两个链表的第一个公共结点](https://www.nowcoder.com/practice/6ab1d9a29e88450685099d45c9e31e46?tpId=13&tqId=11189&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T36.java)|时间空间效率的平衡|
|37|[数字在排序数组中出现的次数](https://www.nowcoder.com/practice/70610bf967994b22bb1c26f9ae901fa2?tpId=13&tqId=11190&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T37.java)|知识迁移能力|
|38|[二叉树的深度](https://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b?tpId=13&tqId=11191&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T38.java)|知识迁移能力|
|39|[平衡二叉树](https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=13&tqId=11192&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T39.java)|知识迁移能力|
|40|[数组中只出现一次的数字](https://www.nowcoder.com/practice/e02fdb54d7524710a7d664d082bb7811?tpId=13&tqId=11193&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T40.java)|知识迁移能力|
|41|[和为S的连续整数序列](https://www.nowcoder.com/practice/c451a3fd84b64cb19485dad758a55ebe?tpId=13&tqId=11194&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T41.java)|知识迁移能力|
|42|[和为S的两个数字](https://www.nowcoder.com/practice/390da4f7a00f44bea7c2f3d19491311b?tpId=13&tqId=11195&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T42.java)|知识迁移能力|
|43|[左旋转字符串](https://www.nowcoder.com/practice/12d959b108cb42b1ab72cef4d36af5ec?tpId=13&tqId=11196&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T43.java)|知识迁移能力|
|44|[翻转单词顺序列](https://www.nowcoder.com/practice/3194a4f4cf814f63919d0790578d51f3?tpId=13&tqId=11197&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T44.java)|知识迁移能力|
|45|[扑克牌顺子](https://www.nowcoder.com/practice/762836f4d43d43ca9deb273b3de8e1f4?tpId=13&tqId=11198&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T45.java)|抽象建模能力|
|46|[孩子们的游戏（圆圈中最后剩下的数）](https://www.nowcoder.com/practice/f78a359491e64a50bce2d89cff857eb6?tpId=13&tqId=11199&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T46.java)|抽象建模能力|
|47|[求1+2+3+...+n](https://www.nowcoder.com/practice/7a0da8fc483247ff8800059e12d7caf1?tpId=13&tqId=11200&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T47.java)|发散思维能力|
|48|[不用加减乘除做加法](https://www.nowcoder.com/practice/59ac416b4b944300b617d4f7f111b215?tpId=13&tqId=11201&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T48.java)|发散思维能力|
|49|[将字符串转化为整数](https://www.nowcoder.com/practice/1277c681251b4372bdef344468e4f26e?tpId=13&tqId=11202&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T49.java)|综合|
|50|[数组中重复的数字](https://www.nowcoder.com/practice/623a5ac0ea5b4e5f95552655361ae0a8?tpId=13&tqId=11203&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T50.java)|数组|
|51|[构建乘积数组](https://www.nowcoder.com/practice/94a4d381a68b47b7a8bed86f2975db46?tpId=13&tqId=11204&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T51.java)|数组|
|52|[正则表达式匹配](https://www.nowcoder.com/practice/45327ae22b7b413ea21df13ee7d6429c?tpId=13&tqId=11205&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T52.java)|字符串|
|53|[表示数值的字符串](https://www.nowcoder.com/practice/6f8c901d091949a5837e24bb82a731f2?tpId=13&tqId=11206&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T53.java)|字符串|
|54|[字符流中第一个不重复的字符](https://www.nowcoder.com/practice/00de97733b8e4f97a3fb5c680ee10720?tpId=13&tqId=11207&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T54.java)|字符串|
|55|[链表中环的入口结点](https://www.nowcoder.com/practice/253d2c59ec3e4bc68da16833f79a38e4?tpId=13&tqId=11208&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T55.java)|链表|
|56|[删除链表中重复的结点](https://www.nowcoder.com/practice/fc533c45b73a41b0b44ccba763f866ef?tpId=13&tqId=11209&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T56.java)|链表|
|57|[二叉树的下一个结点](https://www.nowcoder.com/practice/9023a0c988684a53960365b889ceaf5e?tpId=13&tqId=11210&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T57.java)|树|
|58|[对称的二叉树](https://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb?tpId=13&tqId=11211&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T58.java)|树|
|59|[按之字形打印顺序打印二叉树](https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0?tpId=13&tqId=11212&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T59.java)|树|
|60|[把二叉树打印成多行](https://www.nowcoder.com/practice/445c44d982d04483b04a54f298796288?tpId=13&tqId=11213&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T60.java)|树|
|61|[序列化二叉树](https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T61.java)|树|
|62|[二叉搜索树的第k个结点](https://www.nowcoder.com/practice/ef068f602dde4d28aab2b210e859150a?tpId=13&tqId=11215&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T62.java)|树|
|63|[数据流中的中位数](https://www.nowcoder.com/practice/9be0172896bd43948f8a32fb954e1be1?tpId=13&tqId=11216&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T63.java)|树|
|64|[滑动窗口的最大值](https://www.nowcoder.com/practice/1624bc35a45c42c0bc17d17fa0cba788?tpId=13&tqId=11217&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T64.java)|栈和队列|
|65|[矩阵中的路径](https://www.nowcoder.com/practice/c61c6999eecb4b8f88a98f66b273a3cc?tpId=13&tqId=11218&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T65.java)|回溯法|
|66|[机器人的运动范围](https://www.nowcoder.com/practice/6e5207314b5241fb83f2329e89fdecc8?tpId=13&tqId=11219&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)| [Java](https://github.com/jxnu-liguobin/cs-summary-reflection/tree/master/java-leetcode/src/main/java/io/github/dreamylost/tooffer/T66.java)|回溯法|

参考牛客网讨论区以及[GoOffer](https://github.com/liuenci/GoOffer)的漂亮排版


如有歧义和Bug，提交PR即可