# CodingInterviews

**Repository Path**: srwpf/CodingInterviews

## Basic Information

- **Project Name**: CodingInterviews
- **Description**: 剑指Offer——名企面试官精讲典型编程题
- **Primary Language**: Unknown
- **License**: GPL-3.0
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2019-10-21
- **Last Updated**: 2020-12-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

| 牛客OJ | 九度OJ | CSDN题解 | GitHub代码 |
|--------|:------:|:--------:|:----------:|
| [牛客剑指Offer题目列表](http://www.nowcoder.com/ta/coding-interviews?page=) | [九度OJ剑指Offer题目列表](http://ac.jobdu.com/hhtproblems.php) | [剑指Offer](http://blog.csdn.net/gatieme/article/category/6174073) | [CodingInterviews--剑指Offer--名企面试官精讲典型编程题 ](https://github.com/gatieme/CodingInterviews) | 
<br>

| 牛客OJ | 九度OJ | CSDN题解 | GitHub代码 |
|--------|:------:|:--------:|:----------:|
| [003--二维数组中的查找](http://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e?tpId=13&tqId=11154&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)  | [1384-二维数组中的查找](http://ac.jobdu.com/problem.php?pid=1384) |  [剑指Offer--003--二维数组中的查找](http://blog.csdn.net/gatieme/article/details/51100125)  | [003二维数组中的查找](https://github.com/gatieme/CodingInterviews/tree/master/003-%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE) |
| [004--替换空格](http://www.nowcoder.com/practice/4060ac7e3e404ad1a894ef3e17650423?tpId=13&tqId=11155&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking)  | [1510-替换空格](http://ac.jobdu.com/problem.php?pid=1510)   | [剑指Offer--004-替换空格](http://blog.csdn.net/gatieme/article/details/51100630)   | [004-替换空格](https://github.com/gatieme/CodingInterviews/tree/master/004-%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC)  |
| [005--从尾到头打印链表](http://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035?tpId=13&tqId=11156&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | [1511-从尾到头打印链表](http://ac.jobdu.com/problem.php?pid=1511)   | [剑指Offer--005-从尾到头打印链表](http://blog.csdn.net/gatieme/article/details/51107632)   | [005-从尾到头打印链表](https://github.com/gatieme/CodingInterviews/tree/master/005-%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8)  |
| [006--重建二叉树](http://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6?tpId=13&tqId=11157&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1385-重建二叉树](http://ac.jobdu.com/problem.php?pid=1385)   | [剑指Offer--006-重构二叉树](http://blog.csdn.net/gatieme/article/details/51108612) | [006-重建二叉树](https://github.com/gatieme/CodingInterviews/tree/master/006-%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91)  |
|[007--用两个栈实现队列](http://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6?tpId=13&tqId=11158&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-rankingg) | [1512-用两个栈实现队列](http://ac.jobdu.com/problem.php?pid=1512)   | [剑指Offer--007-用两个栈实现队列](http://blog.csdn.net/gatieme/article/details/51112580) | [007-用两个栈实现队列](https://github.com/gatieme/CodingInterviews/tree/master/007-%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97)   |
|[008--旋转数组的最小数字](http://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba?tpId=13&tqId=11159&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-rankingg)  | [1386-旋转数组的最小数字](http://ac.jobdu.com/problem.php?pid=1386)   | [剑指Offer--008-旋转数组的最小数字](http://blog.csdn.net/gatieme/article/details/51115386) | [008-旋转数组的最小数字](https://github.com/gatieme/CodingInterviews/tree/master/008-%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97)|
|[009--斐波那契数列](http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-rankingg) | [1387-斐波那契数列](http://ac.jobdu.com/problem.php?pid=1387) | [剑指Offer--009-斐波那契数列](http://blog.csdn.net/gatieme/article/details/51115810) | [009-斐波那契数列](https://github.com/gatieme/CodingInterviews/tree/master/009-%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97)|
|[010--二进制中1的个数](http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-rankingg) | [1513-二进制中1的个数](http://ac.jobdu.com/problem.php?pid=1513) | [剑指Offer--010-二进制中1的个数](http://blog.csdn.net/gatieme/article/details/51122144) | [010-二进制中1的个数](https://github.com/gatieme/CodingInterviews/tree/master/010-二进制中1的个数)|
|[011--数值的整数次方](http://www.nowcoder.com/practice/1a834e5e3e1a4b7ba251417554e07c00?tpId=13&tqId=11165&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | [1514-数值的整数次方](http://ac.jobdu.com/problem.php?pid=1514) | [剑指Offer--011-数值的整数次方](http://blog.csdn.net/gatieme/article/details/51123043) | [011-数值的整数次方](https://github.com/gatieme/CodingInterviews/tree/master/011-数值的整数次方)|
| 未收录  | [1515-打印1到最大的N位数](http://ac.jobdu.com/problem.php?pid=1515) | [剑指Offer--012-打印1到最大的N位数](http://blog.csdn.net/gatieme/article/details/51132108) | [012-打印1到最大的N位数](https://github.com/gatieme/CodingInterviews/tree/master/012-%E6%89%93%E5%8D%B01%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84N%E4%BD%8D%E6%95%B0)|
|[014--调整数组顺序使奇数位于偶数前面](http://www.nowcoder.com/practice/beb5aa231adc45b2a5dcc5b62c93f593?tpId=13&tqId=11166&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1516-调整数组顺序使奇数位于偶数前面](http://ac.jobdu.com/problem.php?pid=1516) | [剑指Offer--014-调整数组顺序使奇数位于偶数前面](http://blog.csdn.net/gatieme/article/details/51133277) | [014-调整数组顺序使奇数位于偶数前面](https://github.com/gatieme/CodingInterviews/tree/master/014-调整数组顺序使奇数位于偶数前面)|
|[015--链表中倒数第k个结点](http://www.nowcoder.com/practice/529d3ae5a407492994ad2a246518148a?tpId=13&tqId=11167&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1517-链表中倒数第k个结点](http://ac.jobdu.com/problem.php?pid=1517) | [剑指Offer--015-链表中倒数第k个结点](http://blog.csdn.net/gatieme/article/details/51133817) | [015-链表中倒数第k个结点](https://github.com/gatieme/CodingInterviews/tree/master/015-链表中倒数第k个结点)|
|[016--反转链表](http://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=13&tqId=11168&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1518-反转链表](http://ac.jobdu.com/problem.php?pid=1518) | [剑指Offer--016-反转链表](http://blog.csdn.net/gatieme/article/details/51135119) | [016-反转链表](https://github.com/gatieme/CodingInterviews/tree/master/016-反转链表)|
|[017--合并两个排序的链表](http://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&tqId=11169&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1519-合并两个排序的链表](http://ac.jobdu.com/problem.php?pid=1518) | [剑指Offer--017-合并两个排序的链表](http://blog.csdn.net/gatieme/article/details/51138298) | [017-合并两个排序的链表](https://github.com/gatieme/CodingInterviews/tree/master/017-合并两个排序的链表)|
|[018--树的子结构](http://www.nowcoder.com/practice/6e196c44c7004d15b1610b9afca8bd88?tpId=13&tqId=11170&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | [1520-树的子结构](http://ac.jobdu.com/problem.php?pid=1520) | [剑指Offer--018-树的子结构](http://blog.csdn.net/gatieme/article/details/51151916) | [018-树的子结构](https://github.com/gatieme/CodingInterviews/tree/master/018-树的子结构)|
|[019--二叉树的镜像](http://www.nowcoder.com/practice/564f4c26aa584921bc75623e48ca3011?tpId=13&tqId=11171&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | [1521-二叉树的镜像](http://ac.jobdu.com/problem.php?pid=1521) | [剑指Offer--019-二叉树的镜像](http://blog.csdn.net/gatieme/article/details/51175749) | [019-二叉树的镜像](https://github.com/gatieme/CodingInterviews/tree/master/019-二叉树的镜像) |
|[020--顺时针打印矩阵](http://www.nowcoder.com/practice/9b4c81a02cd34f76be2659fa0d54342a?tpId=13&tqId=11172&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | [1391-顺时针打印矩阵](http://ac.jobdu.com/problem.php?pid=1391) | [剑指Offer--020-顺时针打印矩阵](http://blog.csdn.net/gatieme/article/details/51182615) | [020-顺时针打印矩阵](https://github.com/gatieme/CodingInterviews/tree/master/020-顺时针打印矩阵) |
|[021--包含min函数的栈](http://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49?tpId=13&tqId=11173&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | [1522-包含min函数的栈](http://ac.jobdu.com/problem.php?pid=1522) | [剑指Offer--021-包含min函数的栈](http://blog.csdn.net/gatieme/article/details/51184578) | [021-包含min函数的栈](https://github.com/gatieme/CodingInterviews/tree/master/021-包含min函数的栈) |
|[022--栈的压入、弹出序列](http://www.nowcoder.com/practice/d77d11405cc7470d82554cb392585106?tpId=13&tqId=11174&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1366-栈的压入、弹出序列](http://ac.jobdu.com/problem.php?pid=1366) | [剑指Offer--022栈的压入、弹出序列](http://blog.csdn.net/gatieme/article/details/51190653) | [022-栈的压入弹出序列](https://github.com/gatieme/CodingInterviews/tree/master/022-栈的压入弹出序列) |
|[023--从上往下打印二叉树](http://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701?tpId=13&tqId=11175&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | [1523-从上往下打印二叉树](http://ac.jobdu.com/problem.php?pid=1523) | [剑指Offer--023-从上往下打印二叉树](http://blog.csdn.net/gatieme/article/details/51204976) | [023-从上往下打印二叉树](https://github.com/gatieme/CodingInterviews/tree/master/023-从上往下打印二叉树) |
|[024--二叉搜索树的后序遍历序列](http://www.nowcoder.com/practice/a861533d45854474ac791d90e447bafd?tpId=13&tqId=11176&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | [1523-二叉搜索树的后序遍历序列](http://ac.jobdu.com/problem.php?pid=1367) | [剑指Offer--024-二叉搜索树的后序遍历序列](http://blog.csdn.net/gatieme/article/details/51213665) | [024-二叉搜索树的后序遍历序列](https://github.com/gatieme/CodingInterviews/tree/master/024-二叉搜索树的后序遍历序列) |
|[025--二叉树中和为某一值的路径](http://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tqId=11177&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1368-二叉树中和为某一值的路径](http://ac.jobdu.com/problem.php?pid=1368) | [剑指Offer--025-二叉树中和为某一值的路径](http://blog.csdn.net/gatieme/article/details/51214182) | [025-二叉树中和为某一值的路径](https://github.com/gatieme/CodingInterviews/tree/master/025-二叉树中和为某一值的路径) |
|[026--复杂链表的复制](http://www.nowcoder.com/practice/f836b2c43afc4b35ad6adc41ec941dba?tpId=13&tqId=11178&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1524-复杂链表的复制](http://ac.jobdu.com/problem.php?pid=1524) | [剑指Offer--026-复杂链表的复制](http://blog.csdn.net/gatieme/article/details/51227939) | [026-复杂链表的复制](https://github.com/gatieme/CodingInterviews/tree/master/026-复杂链表的复制) |
|[027--二叉搜索树与双向链表](http://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5?tpId=13&tqId=11179&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1503-二叉搜索树与双向链表](http://ac.jobdu.com/problem.php?pid=1503) | [剑指Offer--027-二叉搜索树与双向链表](http://blog.csdn.net/gatieme/article/details/51234524) | [027-二叉搜索树与双向链表](https://github.com/gatieme/CodingInterviews/tree/master/027-二叉搜索树与双向链表) |
|[028--字符串的排列](http://www.nowcoder.com/practice/fe6b651b66ae47d7acce78ffdd9a96c7?tpId=13&tqId=11180&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1369-字符串的排列](http://ac.jobdu.com/problem.php?pid=1369) | [剑指Offer--028-字符串的排列](http://blog.csdn.net/gatieme/article/details/51251158) | [028-字符串的排列](https://github.com/gatieme/CodingInterviews/tree/master/028-字符串的排列) |
|[029--数组中出现次数超过一半的数字](http://www.nowcoder.com/practice/e8a1b01a2df14cb2b228b30ee6a92163?tpId=13&tqId=11181&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | [1370-数组中出现次数超过一半的数字](http://ac.jobdu.com/problem.php?pid=1370) | [剑指Offer--029-数组中出现次数超过一半的数字](http://blog.csdn.net/gatieme/article/details/51251311) | [029-数组中出现次数超过一半的数字](https://github.com/gatieme/CodingInterviews/tree/master/029-数组中出现次数超过一半的数字) |
|[030--最小的K个数](http://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf?tpId=13&tqId=11182&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1371-最小的K个数](http://ac.jobdu.com/problem.php?pid=1371) | [剑指Offer--030-最小的K个数](http://blog.csdn.net/gatieme/article/details/51277505) | [030-最小的K个数](https://github.com/gatieme/CodingInterviews/tree/master/030-最小的K个数) |
|[031-连续子数组的最大和](http://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484?tpId=13&tqId=11183&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1372-连续子数组的最大和](http://ac.jobdu.com/problem.php?pid=1372) | [剑指Offer--031-连续子数组的最大和](http://blog.csdn.net/gatieme/article/details/51287801) | [031-连续子数组的最大和](https://github.com/gatieme/CodingInterviews/tree/master/031-连续子数组的最大和) |
|[032-从1到n整数中1出现的次数](http://www.nowcoder.com/practice/bd7f978302044eee894445e244c7eee6?tpId=13&tqId=11184&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1373-从1到n整数中1出现的次数](http://ac.jobdu.com/problem.php?pid=1373) | [剑指Offer--032-从1到n整数中1出现的次数](http://blog.csdn.net/gatieme/article/details/51292339) | [032-从1到n整数中1出现的次数](https://github.com/gatieme/CodingInterviews/tree/master/032-从1到n整数中1出现的次数) |
|[033-把数组排成最小的数](http://www.nowcoder.com/practice/8fecd3f8ba334add803bf2a06af1b993?tpId=13&tqId=11185&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1504-把数组排成最小的数](http://ac.jobdu.com/problem.php?pid=1504) | [剑指Offer--033-把数组排成最小的数](http://blog.csdn.net/gatieme/article/details/51303662) | [033-把数组排成最小的数](https://github.com/gatieme/CodingInterviews/tree/master/033-把数组排成最小的数) |
|[034-丑数](http://www.nowcoder.com/practice/6aa9e04fc3794f68acf8778237ba065b?tpId=13&tqId=11186&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1214-丑数](http://ac.jobdu.com/problem.php?pid=1214) | [剑指Offer--034-丑数](http://blog.csdn.net/gatieme/article/details/51308037) | [034-丑数](https://github.com/gatieme/CodingInterviews/tree/master/034-丑数) |
|[035-第一个只出现一次的字符位置](http://www.nowcoder.com/practice/1c82e8cf713b4bbeb2a5b31cf5b0417c?tpId=13&tqId=11187&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1283-第一个只出现一次的字符位置](http://ac.jobdu.com/problem.php?pid=1283) | [剑指Offer--035-第一个只出现一次的字符位置](http://blog.csdn.net/gatieme/article/details/51319158) | [035-第一个只出现一次的字符位置](https://github.com/gatieme/CodingInterviews/tree/master/035-第一个只出现一次的字符位置) |
|[036-数组中的逆序对](http://www.nowcoder.com/practice/96bd6684e04a44eb80e6a68efc0ec6c5?tpId=13&tqId=11188&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1348-数组中的逆序对](http://ac.jobdu.com/problem.php?pid=1348) | [剑指Offer--036-数组中的逆序对](http://blog.csdn.net/gatieme/article/details/51326994) | [036-数组中的逆序对](https://github.com/gatieme/CodingInterviews/tree/master/036-数组中的逆序对) |
|[037-两个链表的第一个公共结点](http://www.nowcoder.com/practice/6ab1d9a29e88450685099d45c9e31e46?tpId=13&tqId=11189&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1505-两个链表的第一个公共结点](http://ac.jobdu.com/problem.php?pid=1505) | [剑指Offer--037-两个链表的第一个公共结点](http://blog.csdn.net/gatieme/article/details/51330871) | [037-两个链表的第一个公共结点](https://github.com/gatieme/CodingInterviews/tree/master/037-两个链表的第一个公共结点) |
|[038-数字在排序数组中出现的次数](http://www.nowcoder.com/practice/70610bf967994b22bb1c26f9ae901fa2?tpId=13&tqId=11190&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1505-数字在排序数组中出现的次数](http://ac.jobdu.com/problem.php?pid=1349) | [剑指Offer--038-数字在排序数组中出现的次数](http://blog.csdn.net/gatieme/article/details/51335323) | [038-数字在排序数组中出现的次数](https://github.com/gatieme/CodingInterviews/tree/master/038-数字在排序数组中出现的次数) |
|[039-二叉树的深度](http://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b?tpId=13&tqId=11191&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1350-二叉树的深度](http://ac.jobdu.com/problem.php?pid=1350) | [剑指Offer--039-二叉树的深度](http://blog.csdn.net/gatieme/article/details/51339884) | [039-二叉树的深度](https://github.com/gatieme/CodingInterviews/tree/master/039-二叉树的深度) |
|[039-平衡二叉树](http://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=13&tqId=11192&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | 未收录 | [剑指Offer--039-平衡二叉树](http://blog.csdn.net/gatieme/article/details/51346422) | [039-平衡二叉树](https://github.com/gatieme/CodingInterviews/tree/master/039-平衡二叉树%5B附加%5D) ||[040-数组中只出现一次的数字](http://www.nowcoder.com/practice/e02fdb54d7524710a7d664d082bb7811?tpId=13&tqId=11193&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1351-数组中只出现一次的数字](http://ac.jobdu.com/problem.php?pid=1351) | [剑指Offer--040-数组中只出现一次的数字](http://blog.csdn.net/gatieme/article/details/51352156) | [040-数组中只出现一次的数字](https://github.com/gatieme/CodingInterviews/tree/master/040-数组中只出现一次的数字) |
|[040-数组中只出现一次的数字](http://www.nowcoder.com/practice/e02fdb54d7524710a7d664d082bb7811?tpId=13&tqId=11193&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1351-数组中只出现一次的数字](http://ac.jobdu.com/problem.php?pid=1351) | [剑指Offer--040-数组中只出现一次的数字](http://blog.csdn.net/gatieme/article/details/51352156) | [040-数组中只出现一次的数字](https://github.com/gatieme/CodingInterviews/tree/master/040-数组中只出现一次的数字) |
|[041-和为S的连续正数序列](http://www.nowcoder.com/practice/c451a3fd84b64cb19485dad758a55ebe?tpId=13&tqId=11194&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1354-和为S的连续正数序列](http://ac.jobdu.com/problem.php?pid=1354) | [剑指Offer--041-和为S的连续正数序列](http://blog.csdn.net/gatieme/article/details/51357308) | [041-和为S的连续正数序列](https://github.com/gatieme/CodingInterviews/tree/master/041-和为S的连续正数序列) |
|[042-翻转单词顺序列](http://www.nowcoder.com/practice/3194a4f4cf814f63919d0790578d51f3?tpId=13&tqId=11197&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1361-翻转单词顺序列](http://ac.jobdu.com/problem.php?pid=1361) | [剑指Offer--042-翻转单词顺序列](http://blog.csdn.net/gatieme/article/details/51419097) | [042-翻转单词顺序列](https://github.com/gatieme/CodingInterviews/tree/master/042-翻转单词顺序列) |
|[042-左旋转字符串](http://www.nowcoder.com/practice/12d959b108cb42b1ab72cef4d36af5ec?tpId=13&tqId=11196&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1362-左旋转字符串](http://ac.jobdu.com/problem.php?pid=1362) | [剑指Offer--042-左旋转字符串](http://blog.csdn.net/gatieme/article/details/51407858) | [042-左旋转字符串](https://github.com/gatieme/CodingInterviews/tree/master/042-左旋转字符串) |
|[044-扑克牌顺子](http://www.nowcoder.com/practice/762836f4d43d43ca9deb273b3de8e1f4?tpId=13&tqId=11198&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1355-扑克牌顺子](http://ac.jobdu.com/problem.php?pid=1355) | [剑指Offer--044-扑克牌顺子](http://blog.csdn.net/gatieme/article/details/51427573) | [044-扑克牌顺子](https://github.com/gatieme/CodingInterviews/tree/master/044-扑克牌顺子) |
|[045-孩子们的游戏(圆圈中最后剩下的数)](http://www.nowcoder.com/practice/f78a359491e64a50bce2d89cff857eb6?tpId=13&tqId=11199&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1356-孩子们的游戏(圆圈中最后剩下的数)](http://ac.jobdu.com/problem.php?pid=1356) | [剑指Offer--045-孩子们的游戏(圆圈中最后剩下的数)](http://blog.csdn.net/gatieme/article/details/51435055) | [045-孩子们的游戏(圆圈中最后剩下的数)](https://github.com/gatieme/CodingInterviews/tree/master/045-孩子们的游戏(圆圈中最后剩下的数)) |
|[046-求1+2+3+...+n](http://www.nowcoder.com/practice/7a0da8fc483247ff8800059e12d7caf1?tpId=13&tqId=11200&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1506-求1+2+3+...+n](http://ac.jobdu.com/problem.php?pid=1506) | [剑指Offer--046-求1+2+3+...+n](http://blog.csdn.net/gatieme/article/details/51485713) | [046-求1+2+3+...+n](https://github.com/gatieme/CodingInterviews/tree/master/046-求1+2+3+...+n) |
|[047-不用加减乘除做加法](http://www.nowcoder.com/practice/59ac416b4b944300b617d4f7f111b215?tpId=13&tqId=11201&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1507-不用加减乘除做加法](http://ac.jobdu.com/problem.php?pid=1507) | [剑指Offer--047-不用加减乘除做加法](http://blog.csdn.net/gatieme/article/details/51493414) | [047-不用加减乘除做加法](https://github.com/gatieme/CodingInterviews/tree/master/047-不用加减乘除做加法) |
| 不适合在线评测 | 不适合在线评测 | [剑指Offer--048-不能被继承的类](http://blog.csdn.net/gatieme/article/details/51485713) | [048-不能被继承的类](https://github.com/gatieme/CodingInterviews/tree/master/048-不能被继承的类) |
|[049-把字符串转换成整数](http://www.nowcoder.com/practice/1277c681251b4372bdef344468e4f26e?tpId=13&tqId=11202&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1508-把字符串转换成整数](http://ac.jobdu.com/problem.php?pid=1508) | [剑指Offer--049-把字符串转换成整数](http://blog.csdn.net/gatieme/article/details/51502651) | [049-把字符串转换成整数](https://github.com/gatieme/CodingInterviews/tree/master/049-把字符串转换成整数) |
|[051-数组中重复的数字](http://www.nowcoder.com/practice/623a5ac0ea5b4e5f95552655361ae0a8?tpId=13&tqId=11203&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1508-数组中重复的数字](http://ac.jobdu.com/problem.php?pid=1508) | [剑指Offer--051-数组中重复的数字](http://blog.csdn.net/gatieme/article/details/51540159) | [051-数组中重复的数字](https://github.com/gatieme/CodingInterviews/tree/master/051-数组中重复的数字) |
|[052-构建乘积数组](http://www.nowcoder.com/practice/94a4d381a68b47b7a8bed86f2975db46?tpId=13&tqId=11204&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1508-构建乘积数组](http://ac.jobdu.com/problem.php?pid=1508) | [剑指Offer--052-构建乘积数组](http://blog.csdn.net/gatieme/article/details/51540159) | [052-构建乘积数组](https://github.com/gatieme/CodingInterviews/tree/master/052-构建乘积数组) |
|[053-正则表达式匹配](http://www.nowcoder.com/practice/45327ae22b7b413ea21df13ee7d6429c?tpId=13&tqId=11205&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | 未收录 | [剑指Offer--053-正则表达式匹配](http://blog.csdn.net/gatieme/article/details/51542072) | [053-正则表达式匹配](https://github.com/gatieme/CodingInterviews/tree/master/053-正则表达式匹配) |
|[054-表示数值的字符串](http://www.nowcoder.com/practice/6f8c901d091949a5837e24bb82a731f2?tpId=13&tqId=11206&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | 未收录 | [剑指Offer--054-表示数值的字符串](http://blog.csdn.net/gatieme/article/details/51559282) | [054-表示数值的字符串](https://github.com/gatieme/CodingInterviews/tree/master/054-表示数值的字符串) |
|[055-字符流中第一个不重复的字符](http://www.nowcoder.com/practice/00de97733b8e4f97a3fb5c680ee10720?tpId=13&tqId=11207&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | 未收录 | [剑指Offer--055-字符流中第一个不重复的字符](http://blog.csdn.net/gatieme/article/details/51598809) | [055-字符流中第一个不重复的字符](https://github.com/gatieme/CodingInterviews/tree/master/055-字符流中第一个不重复的字符) |
|[056-链表中环的入口结点](http://www.nowcoder.com/practice/253d2c59ec3e4bc68da16833f79a38e4?tpId=13&tqId=11208&rp=3&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | 未收录 | [剑指Offer--056-链表中环的入口结点](http://blog.csdn.net/gatieme/article/details/51602910) | [056-链表中环的入口结点](https://github.com/gatieme/CodingInterviews/tree/master/056-链表中环的入口结点) |
|[057-删除链表中重复的结点](http://www.nowcoder.com/practice/fc533c45b73a41b0b44ccba763f866ef?tpId=13&tqId=11209&rp=3&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | 未收录 | [剑指Offer--057-删除链表中重复的结点](http://blog.csdn.net/gatieme/article/details/51604199) | [057-删除链表中重复的结点](https://github.com/gatieme/CodingInterviews/tree/master/057-删除链表中重复的结点) |
|[058-二叉树的下一个结点](http://www.nowcoder.com/practice/9023a0c988684a53960365b889ceaf5e?tpId=13&tqId=11210&rp=3&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | 未收录 | [剑指Offer--058-二叉树的下一个结点](http://blog.csdn.net/gatieme/article/details/51620237) | [058-二叉树的下一个结点](https://github.com/gatieme/CodingInterviews/tree/master/058-二叉树的下一个结点) |
|[059-对称的二叉树](http://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb?tpId=13&tqId=11211&rp=3&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | 未收录 | [剑指Offer--059-对称的二叉树](http://blog.csdn.net/gatieme/article/details/51620237) | [059-对称的二叉树](https://github.com/gatieme/CodingInterviews/tree/master/059-对称的二叉树) |
|[060-把二叉树打印成多行](http://www.nowcoder.com/practice/445c44d982d04483b04a54f298796288?tpId=13&tqId=11213&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) | 未收录 | [剑指Offer--060-把二叉树打印成多行](http://blog.csdn.net/gatieme/article/details/51622025) | [060-把二叉树打印成多行](https://github.com/gatieme/CodingInterviews/tree/master/060-把二叉树打印成多行) |
|[061-按之字形顺序打印二叉树](http://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0?rp=3) | 未收录 | [剑指Offer--061-按之字形顺序打印二叉树](http://blog.csdn.net/gatieme/article/details/51763476) | [061-按之字形顺序打印二叉树](https://github.com/gatieme/CodingInterviews/tree/master/061-按之字形顺序打印二叉树) |
|[062-序列化二叉树](http://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&rp=4) | 未收录 | [剑指Offer--062-序列化二叉树](http://blog.csdn.net/gatieme/article/details/51901268) | [062-序列化二叉树](https://github.com/gatieme/CodingInterviews/tree/master/062-序列化二叉树) |
|[063-二叉搜索树的第K个结点](http://www.nowcoder.com/practice/ef068f602dde4d28aab2b210e859150a?tpId=13&tqId=11215&rp=4) | 未收录 | [剑指Offer--063-二叉搜索树的第K个结点](http://blog.csdn.net/gatieme/article/details/51902530) | [063-二叉搜索树的第K个结点](https://github.com/gatieme/CodingInterviews/tree/master/063-二叉搜索树的第K个结点) |
|[064-数据流之中的中位数](http://www.nowcoder.com/practice/9be0172896bd43948f8a32fb954e1be1?tpId=13&tqId=11216&rp=4) | 未收录 | [剑指Offer--064-数据流之中的中位数](http://blog.csdn.net/gatieme/article/details/51908274) | [064-数据流之中的中位数](https://github.com/gatieme/CodingInterviews/tree/master/064-数据流之中的中位数) |
|[065-滑动窗口的最大值](http://www.nowcoder.com/practice/1624bc35a45c42c0bc17d17fa0cba788?tpId=13&tqId=11217&rp=4) | 未收录 |  [剑指Offer--065-滑动窗口的最大值](http://blog.csdn.net/gatieme/article/details/51915826) | [065-滑动窗口的最大值](https://github.com/gatieme/CodingInterviews/tree/master/065-滑动窗口的最大值) |