《剑指offer》Java版全系列题解（2021版，持续更新！）

浅浅的花香味﹌ 2022-11-07 13:16 167阅读 0赞

# 《剑指offer》Java版全系列题解（2021版，持续更新！） #

本系列记录了最新版 **《剑指Offer》** 的题解过程与代码，因为原书是c语言。这里用Java代码复现并优化，并包含解题分析。

**希望各位能够点赞，收藏！关注我！** 每日更新！  
2021.4.24 完结

如果在准备java面试，可以看看我的另外一篇文章！[ Java面试复习体系总结（2021版,持续更新）][Java_2021]

<table> 
 <thead> 
  <tr> 
   <th align="center">csdn题解（包含详细分析过程，代码）</th> 
   <th>力扣链接</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114649680" rel="nofollow"> 剑指Offer系列（java版，详细解析） 03. 数组中重复的数字</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/" rel="nofollow">剑指 Offer 03. 数组中重复的数字</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114649715" rel="nofollow"> 剑指Offer系列（java版，详细解析）04.二维数组中的查找</a></td> 
   <td><a href="https://leetcode-cn.com/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof" rel="nofollow"> 二维数组中的查找</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114649727" rel="nofollow"> 剑指Offer系列（java版，详细解析）05.替换空格</a></td> 
   <td><a href="https://leetcode-cn.com/problems/ti-huan-kong-ge-lcof" rel="nofollow">替换空格</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114649751" rel="nofollow"> 剑指Offer系列（java版，详细解析）06.从尾到头打印链表</a></td> 
   <td><a href="https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof" rel="nofollow">从尾到头打印链表</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114649764" rel="nofollow"> 剑指Offer系列（java版，详细解析）07.重建二叉树</a></td> 
   <td><a href="https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof" rel="nofollow"> 重建二叉树</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114649772" rel="nofollow"> 剑指Offer系列（java版，详细解析）08.二叉树的下一个节点</a></td> 
   <td>无</td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114649802" rel="nofollow"> 剑指Offer系列（java版，详细解析）09.用两个栈实现队列</a></td> 
   <td><a href="https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof" rel="nofollow"> 用两个栈实现队列</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114649837" rel="nofollow"> 剑指Offer系列（java版，详细解析）10.斐波那契数列</a></td> 
   <td><a href="https://leetcode-cn.com/problems/fei-bo-na-qi-shu-lie-lcof" rel="nofollow"> 斐波那契数列</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114693115" rel="nofollow"> 剑指Offer系列（java版，详细解析）11.旋转数组的最小数字</a></td> 
   <td><a href="https://leetcode-cn.com/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof" rel="nofollow"> 旋转数组的最小数字</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114693129" rel="nofollow"> 剑指Offer系列（java版，详细解析）12.矩阵中的路径</a></td> 
   <td><a href="https://leetcode-cn.com/problems/ju-zhen-zhong-de-lu-jing-lcof" rel="nofollow"> 矩阵中的路径</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114693136" rel="nofollow"> 剑指Offer系列（java版，详细解析）13.机器人的运动范围</a></td> 
   <td><a href="https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof" rel="nofollow">机器人的运动范围</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114693141" rel="nofollow"> 剑指Offer系列（java版，详细解析）14.剪绳子</a></td> 
   <td><a href="https://leetcode-cn.com/problems/jian-sheng-zi-lcof" rel="nofollow"> 剪绳子</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114693155" rel="nofollow"> 剑指Offer系列（java版，详细解析）15.二进制中1的个数</a></td> 
   <td><a href="https://leetcode-cn.com/problems/er-jin-zhi-zhong-1de-ge-shu-lcof" rel="nofollow"> 二进制中1的个数</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114704427" rel="nofollow">剑指Offer系列（java版，详细解析）16.数值的整数次方</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shu-zhi-de-zheng-shu-ci-fang-lcof" rel="nofollow"> 数值的整数次方</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114704475" rel="nofollow">剑指Offer系列（java版，详细解析）17.打印从1到最大的n位数</a></td> 
   <td><a href="https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof" rel="nofollow"> 打印从1到最大的n位数</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114777016" rel="nofollow">剑指Offer系列（java版，详细解析）18.删除链表节点</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shan-chu-lian-biao-de-jie-dian-lcof" rel="nofollow">删除链表的节点</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114784166" rel="nofollow">剑指Offer系列（java版，详细解析）19.正则表达式匹配</a></td> 
   <td><a href="https://leetcode-cn.com/problems/zheng-ze-biao-da-shi-pi-pei-lcof" rel="nofollow"> 正则表达式匹配</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114785426" rel="nofollow"> 剑指Offer系列（java版，详细解析）20.表示数值的字符串</a></td> 
   <td><a href="https://leetcode-cn.com/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof" rel="nofollow"> 表示数值的字符串</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114893543" rel="nofollow"> 剑指Offer系列（java版，详细解析）21.调整数组顺序使奇数位于偶数前面</a></td> 
   <td><a href="https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof" rel="nofollow">调整数组顺序使奇数位于偶数前面</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114893559" rel="nofollow"> 剑指Offer系列（java版，详细解析）22.链表中倒数第K个节点</a></td> 
   <td><a href="https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof" rel="nofollow">链表中倒数第k个节点</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114893575" rel="nofollow"> 剑指Offer系列（java版，详细解析）24.反转链表</a></td> 
   <td><a href="https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof" rel="nofollow"> 反转链表</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115015033" rel="nofollow"> 剑指Offer系列（java版，详细解析）25.合并两个排序的链表</a></td> 
   <td><a href="https://leetcode-cn.com/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof" rel="nofollow"> 合并两个排序的链表</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115015053" rel="nofollow"> 剑指Offer系列（java版，详细解析）26.树的子结构</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shu-de-zi-jie-gou-lcof" rel="nofollow"> 树的子结构</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115206068" rel="nofollow"> 剑指Offer系列（java版，详细解析）27.二叉树的镜像</a></td> 
   <td><a href="https://leetcode-cn.com/problems/er-cha-shu-de-jing-xiang-lcof" rel="nofollow"> 二叉树的镜像</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115206074" rel="nofollow"> 剑指Offer系列（java版，详细解析）28.对称的二叉树</a></td> 
   <td><a href="https://leetcode-cn.com/problems/dui-cheng-de-er-cha-shu-lcof" rel="nofollow"> 对称的二叉树</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115206097" rel="nofollow"> 剑指Offer系列（java版，详细解析）29.顺时针打印矩阵</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shun-shi-zhen-da-yin-ju-zhen-lcof" rel="nofollow"> 顺时针打印矩阵</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115563367" rel="nofollow">剑指Offer系列（java版，详细解析）30.包含min函数的栈</a></td> 
   <td><a href="https://leetcode-cn.com/problems/bao-han-minhan-shu-de-zhan-lcof" rel="nofollow"> 包含min函数的栈</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115217191" rel="nofollow"> 剑指Offer系列（java版，详细解析）31.栈的压入、弹出序列</a></td> 
   <td><a href="https://leetcode-cn.com/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof" rel="nofollow"> 栈的压入、弹出序列</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115217204" rel="nofollow"> 剑指Offer系列（java版，详细解析）32.从上到下打印二叉树</a></td> 
   <td><a href="https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof" rel="nofollow"> 从上到下打印二叉树</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115217217" rel="nofollow"> 剑指Offer系列（java版，详细解析）33.二叉搜索树的后序遍历序列</a></td> 
   <td><a href="https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof" rel="nofollow"> 二叉搜索树的后序遍历序列</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115217226" rel="nofollow"> 剑指Offer系列（java版，详细解析）34.二叉树中和为某一值的路径</a></td> 
   <td><a href="https://leetcode-cn.com/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof" rel="nofollow"> 二叉树中和为某一值的路径</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115217236" rel="nofollow"> 剑指Offer系列（java版，详细解析）35.复杂链表的复制</a></td> 
   <td><a href="https://leetcode-cn.com/problems/fu-za-lian-biao-de-fu-zhi-lcof" rel="nofollow"> 复杂链表的复制</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115439439" rel="nofollow"> 剑指Offer系列（java版，详细解析）36.二叉搜索树与双向链表</a></td> 
   <td><a href="https://leetcode-cn.com/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof" rel="nofollow"> 二叉搜索树与双向链表</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115439454" rel="nofollow"> 剑指Offer系列（java版，详细解析）37.序列化二叉树</a></td> 
   <td><a href="https://leetcode-cn.com/problems/xu-lie-hua-er-cha-shu-lcof" rel="nofollow"> 序列化二叉树</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115439462" rel="nofollow"> 剑指Offer系列（java版，详细解析）38.字符串的排列</a></td> 
   <td><a href="https://leetcode-cn.com/problems/zi-fu-chuan-de-pai-lie-lcof" rel="nofollow"> 字符串的排列</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115596512" rel="nofollow"> 剑指Offer系列（java版，详细解析）39.数组中出现次数超过一半的数字</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof" rel="nofollow"> 数组中出现次数超过一半的数字</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115596541" rel="nofollow"> 剑指Offer系列（java版，详细解析）40.最小的k个数</a></td> 
   <td><a href="https://leetcode-cn.com/problems/zui-xiao-de-kge-shu-lcof" rel="nofollow"> 最小的k个数</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115596561" rel="nofollow"> 剑指Offer系列（java版，详细解析）41.数据流中的中位数</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shu-ju-liu-zhong-de-zhong-wei-shu-lcof" rel="nofollow"> 数据流中的中位数</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115794215" rel="nofollow"> 剑指Offer系列（java版，详细解析）42.连续子数组的最大和</a></td> 
   <td><a href="https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof" rel="nofollow"> 连续子数组的最大和</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115794223" rel="nofollow"> 剑指Offer系列（java版，详细解析）43. 1~n整数中1出现的次数</a></td> 
   <td><a href="https://leetcode-cn.com/problems/1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof" rel="nofollow"> 1～n 整数中 1 出现的次数</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115794249" rel="nofollow"> 剑指Offer系列（java版，详细解析）44.数字序列中某一位的数字</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof" rel="nofollow"> 数字序列中某一位的数字</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115794257" rel="nofollow"> 剑指Offer系列（java版，详细解析）45.把数组排成最小的数</a></td> 
   <td><a href="https://leetcode-cn.com/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof" rel="nofollow"> 把数组排成最小的数</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115794271" rel="nofollow"> 剑指Offer系列（java版，详细解析）46.把数字翻译成字符串</a></td> 
   <td><a href="https://leetcode-cn.com/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof" rel="nofollow"> 把数字翻译成字符串</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115794290" rel="nofollow"> 剑指Offer系列（java版，详细解析）47.礼物的最大价值</a></td> 
   <td><a href="https://leetcode-cn.com/problems/li-wu-de-zui-da-jie-zhi-lcof" rel="nofollow"> 礼物的最大价值</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115794301" rel="nofollow"> 剑指Offer系列（java版，详细解析）48.最长不含重复字符的子字符串</a></td> 
   <td><a href="https://leetcode-cn.com/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof" rel="nofollow"> 最长不含重复字符的子字符串</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115794321" rel="nofollow"> 剑指Offer系列（java版，详细解析）49.丑数</a></td> 
   <td><a href="https://leetcode-cn.com/problems/chou-shu-lcof" rel="nofollow"> 丑数</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115794489" rel="nofollow"> 剑指Offer系列（java版，详细解析）50.第一个只出现一次的字符</a></td> 
   <td><a href="https://leetcode-cn.com/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof" rel="nofollow"> 第一个只出现一次的字符</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115818089" rel="nofollow"> 剑指Offer系列（java版，详细解析）51.数组中的逆序对</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shu-zu-zhong-de-ni-xu-dui-lcof" rel="nofollow"> 数组中的逆序对</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115818120" rel="nofollow"> 剑指Offer系列（java版，详细解析）52.两个链表的第一个公共节点</a></td> 
   <td><a href="https://leetcode-cn.com/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof" rel="nofollow"> 两个链表的第一个公共节点</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115818186" rel="nofollow"> 剑指Offer系列（java版，详细解析）53.在排序数组中查找数字</a></td> 
   <td><a href="https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof" rel="nofollow"> 在排序数组中查找数字 I</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115818252" rel="nofollow"> 剑指Offer系列（java版，详细解析）54.二叉搜索树的第K大的节点</a></td> 
   <td><a href="https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof" rel="nofollow"> 二叉搜索树的第k大节点</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115818273" rel="nofollow"> 剑指Offer系列（java版，详细解析）55.二叉树的深度</a></td> 
   <td><a href="https://leetcode-cn.com/problems/er-cha-shu-de-shen-du-lcof" rel="nofollow">二叉树的深度</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115818334" rel="nofollow"> 剑指Offer系列（java版，详细解析）56.数字中数字出现的次数</a></td> 
   <td><a href="https://leetcode-cn.com/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof" rel="nofollow"> 数组中数字出现的次数</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115818354" rel="nofollow"> 剑指Offer系列（java版，详细解析）57.和为s的数字</a></td> 
   <td><a href="https://leetcode-cn.com/problems/he-wei-sde-liang-ge-shu-zi-lcof" rel="nofollow">和为s的两个数字</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115818395" rel="nofollow"> 剑指Offer系列（java版，详细解析）58.翻转字符串</a></td> 
   <td><a href="https://leetcode-cn.com/problems/fan-zhuan-dan-ci-shun-xu-lcof" rel="nofollow"> 翻转单词顺序</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/115818428" rel="nofollow"> 剑指Offer系列（java版，详细解析）59.队列的最大值</a></td> 
   <td><a href="https://leetcode-cn.com/problems/dui-lie-de-zui-da-zhi-lcof" rel="nofollow"> 队列的最大值</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/116081576" rel="nofollow"> 剑指Offer系列（java版，详细解析）60.n个骰子的点数</a></td> 
   <td><a href="https://leetcode-cn.com/problems/nge-tou-zi-de-dian-shu-lcof" rel="nofollow"> n个骰子的点数</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/116081581" rel="nofollow"> 剑指Offer系列（java版，详细解析）61.扑克牌中的顺子</a></td> 
   <td><a href="https://leetcode-cn.com/problems/bu-ke-pai-zhong-de-shun-zi-lcof" rel="nofollow"> 扑克牌中的顺子</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/116081594" rel="nofollow"> 剑指Offer系列（java版，详细解析）62.圆圈中最后剩下的数字</a></td> 
   <td><a href="https://leetcode-cn.com/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof" rel="nofollow"> 圆圈中最后剩下的数字</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/116081597" rel="nofollow"> 剑指Offer系列（java版，详细解析）63.股票的最大利润</a></td> 
   <td><a href="https://leetcode-cn.com/problems/gu-piao-de-zui-da-li-run-lcof" rel="nofollow"> 股票的最大利润</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/116081599" rel="nofollow"> 剑指Offer系列（java版，详细解析）64.求1+2+…+n</a></td> 
   <td><a href="https://leetcode-cn.com/problems/qiu-12n-lcof" rel="nofollow"> 求1+2+…+n</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/116081604" rel="nofollow"> 剑指Offer系列（java版，详细解析）65.不用加减乘除做加法</a></td> 
   <td><a href="https://leetcode-cn.com/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof" rel="nofollow"> 不用加减乘除做加法</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/116081607" rel="nofollow"> 剑指Offer系列（java版，详细解析）66.构建乘积数组</a></td> 
   <td><a href="https://leetcode-cn.com/problems/gou-jian-cheng-ji-shu-zu-lcof" rel="nofollow"> 构建乘积数组</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/116081613" rel="nofollow"> 剑指Offer系列（java版，详细解析）67.把字符串转化成整数</a></td> 
   <td><a href="https://leetcode-cn.com/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof" rel="nofollow"> 把字符串转换成整数</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/116081620" rel="nofollow"> 剑指Offer系列（java版，详细解析）68.树中两个节点的最低公共祖先</a></td> 
   <td><a href="https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof" rel="nofollow"> 二叉搜索树的最近公共祖先</a></td> 
  </tr> 
 </tbody> 
</table>

# 解题中的参考知识 #

<table> 
 <thead> 
  <tr> 
   <th align="center">参考知识连接</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/114668261" rel="nofollow"> java中提取整数上的各位数字，数位求和，两种解法！</a></td> 
  </tr> 
  <tr> 
   <td align="center"><a href="https://blog.csdn.net/weixin_43314519/article/details/112603595" rel="nofollow"> Java面试复习体系总结（2021版,持续更新）</a></td> 
  </tr> 
  <tr> 
   <td align="center"></td> 
  </tr> 
 </tbody> 
</table>

[Java_2021]: https://blog.csdn.net/weixin_43314519/article/details/112603595