【剑指offer】Java实现代码汇总

痛定思痛。 2022-06-10 06:22 173阅读 0赞

# CodingInterviews #

《剑指Offer》Java实现，包含了大部分的题目和测试代码

#### GitHub地址：[click me][] ####

#### csdn博客地址：[click me][click me 1] ####

#### 题目列表如下： ####

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

[click me]: https://github.com/linpeiyou/CodingInterviews
[click me 1]: http://blog.csdn.net/qq1263292336/article/category/7023932