【剑指offer】Python、java，C++三种语言同时实现

忘是亡心i 2024-04-18 13:03 13阅读 0赞

### 文章目录 ###

*  一、前言
 *  二、内容查看
 *  三、源码获取
 *  四、相关学习

# 一、前言 #

1、关于剑指offer的题，只要是博主发出来的都是经过牛客AC的  
2、实现语言多半是python和java以及C++同时实现的，部分是用其中一种语言实现的  
3、只是用于交流，毕竟自我感觉整理的很好哎

# 二、内容查看 #

<table> 
 <thead> 
  <tr> 
   <th>序号</th> 
   <th>题目</th> 
   <th>考点</th> 
   <th>知识点</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td>1</td> 
   <td><a href="https://mp.weixin.qq.com/s/yqzAeAyjTr2pt5rC-IjidQ" rel="nofollow">二维数组的查找</a></td> 
   <td>数组</td> 
   <td>查找、数组</td> 
  </tr> 
  <tr> 
   <td>2</td> 
   <td><a href="https://mp.weixin.qq.com/s/zI8-M8Yw3bQoKi67F9w4AQ" rel="nofollow">替换空格</a></td> 
   <td>字符串</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>3</td> 
   <td><a href="https://mp.weixin.qq.com/s/sZPuMPZZvKIZUOnLdKRGTQ" rel="nofollow">从尾到头打印链表</a></td> 
   <td>链表</td> 
   <td>链表</td> 
  </tr> 
  <tr> 
   <td>4</td> 
   <td><a href="https://mp.weixin.qq.com/s/Un4b0iGP6ET9ySRp90ZMcA" rel="nofollow">重建二叉树</a></td> 
   <td>树</td> 
   <td>树</td> 
  </tr> 
  <tr> 
   <td>5</td> 
   <td><a href="https://mp.weixin.qq.com/s/s_jI9JJN0wB9niNEuRHe9w" rel="nofollow">用两个栈实现队列</a></td> 
   <td>栈和队列</td> 
   <td>队列、栈</td> 
  </tr> 
  <tr> 
   <td>6</td> 
   <td><a href="https://mp.weixin.qq.com/s/o6XH0aC0e8WiKovWSUiDOA" rel="nofollow">旋转数组的最小数字</a></td> 
   <td>查找和排序</td> 
   <td>查找</td> 
  </tr> 
  <tr> 
   <td>7</td> 
   <td><a href="https://mp.weixin.qq.com/s/BwSqaGYTDP08odwD6-vF_w" rel="nofollow">斐波那锲数列</a></td> 
   <td>递归和循环</td> 
   <td>递归</td> 
  </tr> 
  <tr> 
   <td>8</td> 
   <td><a href="https://mp.weixin.qq.com/s/5EeMRg_EKKtEiFDhYV6iig" rel="nofollow">跳台阶</a></td> 
   <td>递归和循环</td> 
   <td>递归</td> 
  </tr> 
  <tr> 
   <td>9</td> 
   <td><a href="https://mp.weixin.qq.com/s/tyFySa96B0Yh6XmIcTDjPg" rel="nofollow">变态跳台阶</a></td> 
   <td>递归和循环</td> 
   <td>贪心</td> 
  </tr> 
  <tr> 
   <td>10</td> 
   <td><a href="https://mp.weixin.qq.com/s/iFW-RJZJEx5Y6u3Qia5zYw" rel="nofollow">矩阵覆盖</a></td> 
   <td>递归和循环</td> 
   <td>递归</td> 
  </tr> 
  <tr> 
   <td>11</td> 
   <td><a href="https://mp.weixin.qq.com/s/jn5sju93nayEsR24dn8TuQ" rel="nofollow">二进制中1的个数</a></td> 
   <td>位运算</td> 
   <td>进制转换、补码反码原码</td> 
  </tr> 
  <tr> 
   <td>12</td> 
   <td><a href="https://mp.weixin.qq.com/s/j_WAdN2BbiR-84LilLiqdg" rel="nofollow">数值的整数次方</a></td> 
   <td>代码的完整性</td> 
   <td>数学</td> 
  </tr> 
  <tr> 
   <td>13</td> 
   <td><a href="https://mp.weixin.qq.com/s/TO0HAdDSO4drodVv2YlpvA" rel="nofollow">调整数组顺序使奇数位于偶数前面</a></td> 
   <td>代码的完整性</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>14</td> 
   <td><a href="https://mp.weixin.qq.com/s/mAHxVwILk9zaoIXIgeubIw" rel="nofollow">链表中倒数第K个节点</a></td> 
   <td>代码的鲁棒性</td> 
   <td>链表</td> 
  </tr> 
  <tr> 
   <td>15</td> 
   <td><a href="https://mp.weixin.qq.com/s/7YJ6viwwA7nrDVxYzbqX0Q" rel="nofollow">反转链表</a></td> 
   <td>代码的鲁棒性</td> 
   <td>链表</td> 
  </tr> 
  <tr> 
   <td>16</td> 
   <td><a href="https://mp.weixin.qq.com/s/-3wXQIVusOOknZV3VqRyLQ" rel="nofollow">合并两个排序的链表</a></td> 
   <td>代码的鲁棒性</td> 
   <td>链表</td> 
  </tr> 
  <tr> 
   <td>17</td> 
   <td><a href="https://mp.weixin.qq.com/s/DhoRDZ5LFepHPyJbx8q3Gg" rel="nofollow">树的子结构</a></td> 
   <td>代码的鲁棒性</td> 
   <td>二叉树</td> 
  </tr> 
  <tr> 
   <td>18</td> 
   <td><a href="https://mp.weixin.qq.com/s/mRRxCJcyiYbszCYcjskdrA" rel="nofollow">二叉树的镜像</a></td> 
   <td>面试思考</td> 
   <td>树</td> 
  </tr> 
  <tr> 
   <td>19</td> 
   <td><a href="https://mp.weixin.qq.com/s/CmcgXCN9WQq5JAXA7rsrbg" rel="nofollow">顺时针打印矩阵</a></td> 
   <td>画图让抽象形象化</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>20</td> 
   <td><a href="https://mp.weixin.qq.com/s/MIA09W8FAEoitJ56jjYrHQ" rel="nofollow">包含main函数的栈</a></td> 
   <td>举例让抽象具体化</td> 
   <td>栈</td> 
  </tr> 
  <tr> 
   <td>21</td> 
   <td><a href="https://mp.weixin.qq.com/s/f0e_jVEAUpnKtcz1Ccw_rg" rel="nofollow">栈的压入、弹出序列</a></td> 
   <td>举例让抽象具体化</td> 
   <td>栈</td> 
  </tr> 
  <tr> 
   <td>22</td> 
   <td><a href="https://mp.weixin.qq.com/s/rv_WpekjLQJPDvHOsMkqvA" rel="nofollow">从上往下打印二叉树</a></td> 
   <td>举例让抽象具体化</td> 
   <td>队列、树</td> 
  </tr> 
  <tr> 
   <td>23</td> 
   <td><a href="https://mp.weixin.qq.com/s/ws9MA2t3N-513FlAlkf3Ig" rel="nofollow">二叉树搜索树的后续遍历序列</a></td> 
   <td>举例让抽象具体化</td> 
   <td>栈、树</td> 
  </tr> 
  <tr> 
   <td>24</td> 
   <td><a href="https://mp.weixin.qq.com/s/jnjBWhxNxv-b1Eu-jayjrQ" rel="nofollow">二叉树中和为某一值的路径</a></td> 
   <td>举例让抽象具体化</td> 
   <td>树</td> 
  </tr> 
  <tr> 
   <td>25</td> 
   <td><a href="https://mp.weixin.qq.com/s/7F9C0tzUsb6PinRRRQs-EQ" rel="nofollow">复杂链表的复制</a></td> 
   <td>分解让复杂问题简单</td> 
   <td>链表</td> 
  </tr> 
  <tr> 
   <td>26</td> 
   <td><a href="https://mp.weixin.qq.com/s/lF2xhysYfu6PzGImLyZJ1A" rel="nofollow">二叉搜索树与双向链表</a></td> 
   <td>分解让复杂问题简单</td> 
   <td>链表、树</td> 
  </tr> 
  <tr> 
   <td>27</td> 
   <td><a href="https://mp.weixin.qq.com/s/H-F6Yg8bN7bsZGrwg9dDYg" rel="nofollow">字符串的排序</a></td> 
   <td>让复杂问题简单化</td> 
   <td>字符串、动态规划、递归</td> 
  </tr> 
  <tr> 
   <td>28</td> 
   <td><a href="https://mp.weixin.qq.com/s/v91wumEmWwsbEZWYFviWaQ" rel="nofollow">数组中出现次数超过一半的数字</a></td> 
   <td>时间效率</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>29</td> 
   <td><a href="https://mp.weixin.qq.com/s/A3YDqSSsSzqKMZZdaxjIKw" rel="nofollow">最小的K个树</a></td> 
   <td>时间效率</td> 
   <td>数组、高级算法</td> 
  </tr> 
  <tr> 
   <td>30</td> 
   <td><a href="https://mp.weixin.qq.com/s/uukSrJZ8zGhnL1vJphpGTg" rel="nofollow">连续子数组的最大和</a></td> 
   <td>时间效率</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>31</td> 
   <td><a href="https://mp.weixin.qq.com/s/NxGvmYX32E2Dh_Z6tfSYnw" rel="nofollow">整数中1出现的次数(从1到n整数中1出现的次数)</a></td> 
   <td>时间效率</td> 
   <td>查找、数学</td> 
  </tr> 
  <tr> 
   <td>32</td> 
   <td><a href="https://mp.weixin.qq.com/s/NxGvmYX32E2Dh_Z6tfSYnw" rel="nofollow">把数组排序最小的数</a></td> 
   <td>时间效率</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>33</td> 
   <td><a href="https://mp.weixin.qq.com/s/7RE5GhS8WbDsC1Sd-zDsGw" rel="nofollow">丑数</a></td> 
   <td>时间空间效率平衡</td> 
   <td>穷举</td> 
  </tr> 
  <tr> 
   <td>34</td> 
   <td><a href="https://mp.weixin.qq.com/s/m9q0Fn42sWYKi_6Ml8fPgg" rel="nofollow">第一个只出现一次的字符</a></td> 
   <td>时间空间效率的平衡</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>35</td> 
   <td><a href="https://mp.weixin.qq.com/s/mSk2nXDU4EIg_C5AdVmWIw" rel="nofollow">数组中的逆序对</a></td> 
   <td>时间空间效率的平衡</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>36</td> 
   <td><a href="https://mp.weixin.qq.com/s/yqBuubEG3QUM4xztly1YpQ" rel="nofollow">两个链表的第一个公共节点</a></td> 
   <td>时间空间效率的平衡</td> 
   <td>链表</td> 
  </tr> 
  <tr> 
   <td>37</td> 
   <td><a href="https://mp.weixin.qq.com/s/Djx01r3Y3uzBGCAw98arkQ" rel="nofollow">数字在排序数组中出现的次数</a></td> 
   <td>知识迁移能力</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>38</td> 
   <td><a href="https://mp.weixin.qq.com/s/ZPidv0gTdVcppogc0x_oUQ" rel="nofollow">二叉树的深度</a></td> 
   <td>知识迁移能力</td> 
   <td>树</td> 
  </tr> 
  <tr> 
   <td>39</td> 
   <td><a href="https://mp.weixin.qq.com/s/KA-u03gKcBK4LKzxl4IkSQ" rel="nofollow">平衡二叉树</a></td> 
   <td>知识迁移能力</td> 
   <td>树</td> 
  </tr> 
  <tr> 
   <td>40</td> 
   <td><a href="https://mp.weixin.qq.com/s/QcAFdhqcVRqZPNma8jfYnQ" rel="nofollow">数组中只出现一次的数字</a></td> 
   <td>知识迁移能力</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>41</td> 
   <td><a href="https://mp.weixin.qq.com/s/TI-ssMnYS11y2vC5BJOm2A" rel="nofollow">和为S的连续正数序列</a></td> 
   <td>知识迁移能力</td> 
   <td>穷举</td> 
  </tr> 
  <tr> 
   <td>42</td> 
   <td><a href="https://mp.weixin.qq.com/s/Al7agvnHEIiULyljEQb7_g" rel="nofollow">和为S的两个数字</a></td> 
   <td>知识迁移能力</td> 
   <td>数字</td> 
  </tr> 
  <tr> 
   <td>43</td> 
   <td><a href="https://mp.weixin.qq.com/s/MPiz0i-CwJ9tavHrr_EyUQ" rel="nofollow">左旋转字符串</a></td> 
   <td>知识迁移能力</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>44</td> 
   <td><a href="https://mp.weixin.qq.com/s/7i7uOBjNNxSNt-SlR187pw" rel="nofollow">翻转单词顺序列</a></td> 
   <td>知识迁移能力</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>45</td> 
   <td><a href="https://mp.weixin.qq.com/s/Uy5Pf7JV_doikysXvXcoYQ" rel="nofollow">扑克牌顺子</a></td> 
   <td>抽象建模能力</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>46</td> 
   <td><a href="https://mp.weixin.qq.com/s/E0B5mW_wIE7ZzrrD5KA06w" rel="nofollow">孩子们的游戏(圆圈最后剩下的数)</a></td> 
   <td>抽象建模能力</td> 
   <td>数字、链表</td> 
  </tr> 
  <tr> 
   <td>47</td> 
   <td><a href="https://mp.weixin.qq.com/s/qyNyTlieoiT3Rz59DvnDwA" rel="nofollow">求1+2+3…+n</a></td> 
   <td>发散思维能力</td> 
   <td>进制转换</td> 
  </tr> 
  <tr> 
   <td>48</td> 
   <td><a href="https://mp.weixin.qq.com/s/lQaTu_XpdeD_SCiC5WxjhQ" rel="nofollow">不用加减乘除做加法</a></td> 
   <td>发散思维能力</td> 
   <td>进制转换</td> 
  </tr> 
  <tr> 
   <td>49</td> 
   <td><a href="https://mp.weixin.qq.com/s/ChfdLixGARSSl34Q2JCjUQ" rel="nofollow">把字符串转换成整数</a></td> 
   <td>总和</td> 
   <td>字符串、进制转换</td> 
  </tr> 
  <tr> 
   <td>50</td> 
   <td><a href="https://mp.weixin.qq.com/s/ChfdLixGARSSl34Q2JCjUQ" rel="nofollow">数组中重复的数字</a></td> 
   <td>数组</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>51</td> 
   <td><a href="https://mp.weixin.qq.com/s/4bwWEv97Euvf5UFIvK70Bw" rel="nofollow">构建乘积数组</a></td> 
   <td>构建乘积数组</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>52</td> 
   <td><a href="https://mp.weixin.qq.com/s/Ei75LbYAkIXLDeEo5fhJRA" rel="nofollow">正则表达式匹配</a></td> 
   <td>字符串</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>53</td> 
   <td><a href="https://mp.weixin.qq.com/s/imuEkReJgBPCbcDUM2kKbA" rel="nofollow">表示数值的字符串</a></td> 
   <td>字符串</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>54</td> 
   <td><a href="https://mp.weixin.qq.com/s/cDhodqsE48anOQTIte1iIg" rel="nofollow">字符流中第一个不重复的字符</a></td> 
   <td>字符串</td> 
   <td>字符串</td> 
  </tr> 
  <tr> 
   <td>55</td> 
   <td><a href="https://mp.weixin.qq.com/s/5TvvqYINPVJ7DUWGvuoTkQ" rel="nofollow">链表中环的入口节点</a></td> 
   <td>链表</td> 
   <td>链表</td> 
  </tr> 
  <tr> 
   <td>56</td> 
   <td><a href="https://mp.weixin.qq.com/s/Mtu_sICii_fd69r9oRat5w" rel="nofollow">删除链表中重复的节点</a></td> 
   <td>链表</td> 
   <td>链表</td> 
  </tr> 
  <tr> 
   <td>57</td> 
   <td><a href="https://mp.weixin.qq.com/s/XYmVSK0awGiSCdBCRdeOQw" rel="nofollow">二叉树的下一个节点</a></td> 
   <td>树</td> 
   <td>树</td> 
  </tr> 
  <tr> 
   <td>58</td> 
   <td><a href="https://mp.weixin.qq.com/s/gwv6Qo7z5RFOgvkVXtIjdQ" rel="nofollow">对称的二叉树</a></td> 
   <td>树</td> 
   <td>树</td> 
  </tr> 
  <tr> 
   <td>59</td> 
   <td><a href="https://mp.weixin.qq.com/s/c9O_WRK5cnvmJjjLw5qlMw" rel="nofollow">按之字形顺序打印二叉树</a></td> 
   <td>树</td> 
   <td>栈、树</td> 
  </tr> 
  <tr> 
   <td>60</td> 
   <td><a href="https://mp.weixin.qq.com/s/WHHa954dBcVDXxnSbS22Sg" rel="nofollow">把二叉树打印成多行</a></td> 
   <td>树</td> 
   <td>队列、树</td> 
  </tr> 
  <tr> 
   <td>61</td> 
   <td><a href="https://mp.weixin.qq.com/s/ONYUCAhhB4bKXiMLvd6qUQ" rel="nofollow">序列化二叉树</a></td> 
   <td>树</td> 
   <td>队列、树</td> 
  </tr> 
  <tr> 
   <td>62</td> 
   <td><a href="https://mp.weixin.qq.com/s/TPDfUYbpVdUpxyaBmOslyg" rel="nofollow">二叉搜索树的第k个节点</a></td> 
   <td>树</td> 
   <td>栈、树</td> 
  </tr> 
  <tr> 
   <td>63</td> 
   <td><a href="https://mp.weixin.qq.com/s/u8LyjFQ_Q8IXsqyFpdoF9g" rel="nofollow">数据流中的中位数</a></td> 
   <td>树</td> 
   <td>进制转换</td> 
  </tr> 
  <tr> 
   <td>64</td> 
   <td><a href="https://mp.weixin.qq.com/s/Ai7wQod3RoLvfh3XO6IaFA" rel="nofollow">滑动窗口的最大值</a></td> 
   <td>栈和队列</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>65</td> 
   <td><a href="https://mp.weixin.qq.com/s/s0oxqMrktWkcEYfh-8XzpA" rel="nofollow">旋转数组中的数字</a></td> 
   <td>回溯法</td> 
   <td></td> 
  </tr> 
  <tr> 
   <td>66</td> 
   <td><a href="https://mp.weixin.qq.com/s/OjuL61ANpOO1sJCeGR_KfQ" rel="nofollow">机器人的运动范围</a></td> 
   <td>回溯法</td> 
   <td>数组</td> 
  </tr> 
  <tr> 
   <td>67</td> 
   <td><a href="https://mp.weixin.qq.com/s/zzpVB1idu1XIlPifJKaa4A" rel="nofollow">剪绳子</a></td> 
   <td>动态规划与贪婪</td> 
   <td>贪心</td> 
  </tr> 
 </tbody> 
</table>

# 三、源码获取 #

由于时间关系，源码先不抛出链接那，博主还没来得及上传到github中，所以先暂时不上传了，待更新。

# 四、相关学习 #

也可以关注博主的微信公众号，后期还会继续分享干活，关于数据结构的学习，也可以参考博主[此篇博文][Link 1]

[Link 1]: https://blog.csdn.net/Jiajikang_jjk/article/details/100149405