README.md

# CodingInterviews
《剑指Offer》Java实现，包含了大部分的题目和测试代码  
#### GitHub地址：[click me](https://github.com/linpeiyou/CodingInterviews)
#### csdn博客地址：[click me](http://blog.csdn.net/qq1263292336/article/category/7023932)

#### 题目列表如下：
  
| 题目 | 代码 | 测试 | 博客地址 |
|:---- |:-----|:----- |:----- |
| 面试题3：数组中重复的数字 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_03_DuplicationInArray.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_03_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/77075776) |
| 面试题4：二维数组的查找 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_03_DuplicationInArray.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_04_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75042560) |
| 面试题5：替换空格 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_05_ReplaceSpaces.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_05_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75042667) |
| 面试题6：从头到尾打印链表 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_06_PrintListInReversedOrder.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_06_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75042709) |
| 面试题7：重建二叉树 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_07_ConstructBinaryTree.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_07_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75089453) |
| 面试题8：二叉树的下一个节点 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_08_NextNodeInBinaryTrees.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_08_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75091392) |
| 面试题9：用两个栈实现队列 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_09_QueueWithTwoStacks.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_09_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75094581) |
| 面试题10：斐波那契数列 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_10_Fibonacci.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_10_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75094589) |
| 面试题：变态跳台阶 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_998_JumpFloorII.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_998_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75331876) |
| 面试题：跳台阶 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_999_JumpFloor.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_999_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75331769) |
| 面试题11：旋转数组的最小数字 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_11_MinNumberInRotatedArray.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_11_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75331600) |
| 面试题12：矩阵中的路径 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_12_StringPathInMatrix.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_12_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75332404) |
| 面试题13：机器人的运动范围 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_13_RobotMove.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_13_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75350060) |
| 面试题14：剪绳子 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_14_CuttingRope.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_14_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75369878) |
| 面试题15：二进制中1的个数 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_15_NumberOf1InBinary.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_15_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75448729) |
| 面试题16：数值的整数次方 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_16_Power.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_16_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75449071) |
| 面试题17：打印从1到最大的n位数 | [用递归解决](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_17_Print1ToMaxOfNDigits_1.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_17_1_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75452735) |
| 面试题17：打印从1到最大的n位数 | [用递增的方式解决](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_17_Print1ToMaxOfNDigits_2.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_17_2_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75452735) |
| 面试题18（1）：在O(1)时间内删除链表节点 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_18_01_DeleteNodeInList.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_18_01_Test.java) | 无 |
| 面试题18（2）：删除链表中重复的节点 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_18_02_DeleteDuplicatedNode.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_18_02_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75570527) |
| 面试题19：正则表达式匹配 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_19_RegularExpressionsMatching.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_19_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75734596) |
| 面试题20：表示数值的字符串 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_20_NumericStrings.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_20_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75810038) |
| 面试题21：调整数组顺序使奇数位于偶数前面 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_21_ReorderArray.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_21_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75579364) |
| 面试题22：链表中的倒数第k个节点 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_22_KthNodeFromEnd.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_22_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75579376) |
| 面试题23：链表中环的入口节点 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_23_EntryNodeInListLoop.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_23_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75949225) |
| 面试题24：反转链表 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_24_ReverseList.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_24_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75649034) |
| 面试题25：合并两个排序的链表 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_25_MergeSortedLists.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_25_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75658593) |
| 面试题26：树的子结构 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_26_SubStructureInTree.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_26_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75669454) |
| 面试题27：二叉树的镜像 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_27_MirrorOfBinaryTree.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_27_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75671942) |
| 面试题28：对称的二叉树 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_28_SymmertricalBinaryTree.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_28_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/75675757) |
| 面试题29：顺时针打印矩阵 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_29_PrintMatrix.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_29_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76165855) |
| 面试题30：包含min函数的栈 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_30_MinInStack.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_30_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76166165) |
| 面试题31：栈的压入、弹出序列 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_31_StackPushPopOrder.java) | 没写 | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76167418) |
| 面试题32（1）：从上往下不分行打印二叉树 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_32_01_PrintTreeFromTopToBottom.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_32_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76168081) |
| 面试题32（2）：分行从上到下打印二叉树 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_32_02_PrintTreesInLines.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_32_02_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76168094) |
| 面试题32（3）：之字形打印二叉树 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_32_03_PrintTreesInZigzag.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_32_03_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76199428) |
| 面试题33：二叉搜索树的后序遍历序列 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_33_SequenceOfBST.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_33_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76209017) |
| 面试题34：二叉树中和为某一值的路径 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_34_PathInTree.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_34_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76223402) |
| 面试题35：复杂链表的复制 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_35_CopyComplexList.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_35_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76223436) |
| 面试题36：二叉搜索树与双向链表 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_36_ConvertBinarySearchTree.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_36_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76223456) |
| 面试题37：序列化二叉树 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_37_SerializeBinaryTrees.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_37_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76268753) |
| 面试题38：字符串的排列 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_38_StringPermutation.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_38_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76271131) |
| 面试题：求字符串的所有组合 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_997_StringCombination.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_997_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76285750) |
| 面试题39：数组中出现次数超过一半的数字 | [解法1：使用哈希表](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_39_MoreThanHalfNumber_01.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_39_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76285933) |
| 面试题39：数组中出现次数超过一半的数字 | [解法2：排序后统计](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_39_MoreThanHalfNumber_02.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_39_02_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76285933) |
| 面试题39：数组中出现次数超过一半的数字 | [解法3：基于Partition函数的时间复杂度为O(n)的算法](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_39_MoreThanHalfNumber_03.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_39_03_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76285933) |
| 面试题39：数组中出现次数超过一半的数字 | [解法4：根据数组特点找出时间复杂度为O(n)的算法](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_39_MoreThanHalfNumber_04.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_39_04_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76285933) |
| 面试题40：最小的k个数 | [解法1：partition算法](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_40_KLeastNumbers_01.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_40_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76401594) |
| 面试题40：最小的k个数 | [解法2：优先队列](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_40_KLeastNumbers_02.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_40_02_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76401594) |
| 面试题40：最小的k个数 | [解法3：红黑树](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_40_KLeastNumbers_03.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_40_03_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76401594) |
| 面试题41：数据流的中位数 | [解法1：有优先队列](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_41_StreamMedian_01.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_41_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76435398) |
| 面试题41：数据流的中位数 | [解法2：红黑树](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_41_StreamMedian_02.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_41_02_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76435398) |
| 面试题42：连续子数组的最大和 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_42_GreatestSumOfSubarrays.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_42_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76401216) |
| 面试题43：1~n整数中1出现的次数 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_43_NumberOf1.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_43_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76439613) |
| 面试题44：数字序列中某一位的数字 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_44_DigitsInSequence.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_44_Test.java) | 无 |
| 面试题45：把数组排成最小的数 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_45_SortArrayForMinNumber.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_45_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/77075780) |
| 面试题46：把数字翻译成字符串 | 未完成 | 未完成 | 无 |
| 面试题47：礼物的最大价值 | 未完成 | 未完成 | 无 |
| 面试题48：最长不含重复字符的字符串 | 未完成 | 未完成 | 无 |
| 面试题49：丑数 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_49_UglyNumber.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_49_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76461464) |
| 面试题50（1）：第一个只出现一次的字符 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_50_01_FirstNotRepeatingChar.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_50_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76461628) |
| 面试题50（2）：字符流中第一个只出现一次的字符 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_50_02_FirstCharacterInStream.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_50_02_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76474283) |
| 面试题51：数组中的逆序对 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_51_InversePairs.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_51_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76474491) |
| 面试题52：两个链表的第一个公共节点 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_52_FirstCommonNodesInLists.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_52_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76474503) |
| 面试题53（1）：数字在排序数组中出现的次数 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_53_01_NumberOfK.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_53_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76526218) |
| 面试题53（2）：0~n-1中缺失的数字 | 未完成 | 未完成 | 无 |
| 面试题53（3）：数组中数值和下标相等的元素 | 未完成 | 未完成 | 无 |
| 面试题54：二叉搜索树的第k大节点 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_54_KthNodeInBST) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_54_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76548111) |
| 面试题55（1）：二叉树的深度 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_55_01_TreeDepth.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_55_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76548230) |
| 面试题55（2）：平衡二叉树 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_55_02_BalancedBinaryTree.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_55_02_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76563097) |
| 面试题56（1）：数组中只出现一次的两个数字 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_56_01_NumbersAppearOnce.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_56_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76565755) |
| 面试题56（2）：数组中唯一只出现一次的元素 | 未完成 | 未完成 | 无 |
| 面试题57（1）：和为S的数字 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_57_01_TwoNumbersWithSum.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_57_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76647913) |
| 面试题57（2）：和为S的连续正数序列 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_57_02_ContinuousSequenceWithSum.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_57_02_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76649206) |
| 面试题58（1）：翻转单词顺序 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_58_01_ReverseWordsInSentence.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_58_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76651420) |
| 面试题58（2）：左旋转字符串 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_58_02_LeftRotateString.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_58_02_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76651850) |
| 面试题59（1）：滑动窗口的最大值 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_59_01_MaxInSlidingWindow.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_59_01_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76685832) |
| 面试题59（2）：队列的最大值 | 未完成 | 未完成 | 无 |
| 面试题60：n个骰子的点数 | 未完成 | 未完成 | 无 |
| 面试题61：扑克牌中的顺子 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_61_ContinousCards.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_61_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76686903) |
| 面试题62：圆圈中最后剩下的数字 | 未完成 | 未完成 | 无 |
| 面试题63：股票的最大利润 | 未完成 | 未完成 | 无 |
| 面试题64：求1+2+......+n | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_64_Accumulate.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_64_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76737666) |
| 面试题65：不用加减乘除做加法 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_65_AddTwoNumbers.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_65_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/76737708) |
| 面试题66：构建乘积数组 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_66_ConstructArray.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_66_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/77075713) |
| 面试题67：把字符串转换成整数 | [代码](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/algo/_67_StringToInt.java) | [测试](https://github.com/linpeiyou/CodingInterviews/blob/master/src/com/peige/test/_67_Test.java) | [博客地址](http://blog.csdn.net/qq1263292336/article/details/77096898) |
| 面试题68：树中两个节点的最低公共祖先 | 未完成 | 未完成 | 无 |