算法 - Leetcode - 练习题目 - 记录 - 20201012

待我称王封你为后i 2022-12-14 03:41 195阅读 0赞

1.应用场景

<table> 
 <tbody> 
 <tr> 
 <td>主要用于记录个人leetcode解题过程。</td> 
 </tr> 
 </tbody> 
</table>

2.学习/操作

<table> 
 <tbody> 
 <tr> 
 <td> Note: leetcode 是通过github授权登录&nbsp; // 不要再使用其他账号授权登录, 比如微信 &nbsp; 算法code实现:&nbsp;<a href="https://github.com/ningxiaofa/data_structure_and_algorithm" rel="nofollow">https://github.com/ningxiaofa/data_structure_and_algorithm</a> 同时参考:&nbsp;<a href="https://github.com/pushaowei/arithmetic-php" rel="nofollow">https://github.com/pushaowei/arithmetic-php</a> &nbsp; &nbsp; 解答语言： PHP/JavaScript/Go等 每日一答！ &nbsp; 1.&nbsp; 22 题：&nbsp;<a href="https://leetcode-cn.com/problems/generate-parentheses" rel="nofollow">括号生成</a>&nbsp;&nbsp; <a href="https://time.geekbang.org/course/detail/100019701-67636" rel="nofollow">https://time.geekbang.org/course/detail/100019701-67636</a>&nbsp; //30 | 面试题：生成有效括号组合 <a href="https://leetcode-cn.com/problems/generate-parentheses/submissions/" rel="nofollow">https://leetcode-cn.com/problems/generate-parentheses/submissions/</a> <a href="https://leetcode-cn.com/problems/generate-parentheses/solution/php-di-gui-jian-zhi-by-william-ning/" rel="nofollow">https://leetcode-cn.com/problems/generate-parentheses/solution/php-di-gui-jian-zhi-by-william-ning/</a>&nbsp; // 个人题解 &nbsp; 2. 104 题<a href="https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/" rel="nofollow">. 二叉树的最大深度</a>&nbsp;&nbsp;-- 20201015&nbsp;周四&nbsp; 家里 <a href="https://time.geekbang.org/course/detail/100019701-67635" rel="nofollow">https://time.geekbang.org/course/detail/100019701-67635</a>&nbsp; //29 | 面试题：二叉树的最大和最小深度 =====&gt; 最小深度参见 3 <a href="https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/submissions/" rel="nofollow">https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/submissions/</a>&nbsp;//递归方式 认真学习：&nbsp;PHP BFS解法 <a href="https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/solution/php-bfsjie-fa-by-lyyw/" rel="nofollow">https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/solution/php-bfsjie-fa-by-lyyw/</a> &nbsp; 3.111&nbsp;题<a href="https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/" rel="nofollow">. 二叉树的最小深度</a>&nbsp;-- 20201017 周六&nbsp; 家里 <a href="https://time.geekbang.org/course/detail/100019701-67635" rel="nofollow">https://time.geekbang.org/course/detail/100019701-67635</a>&nbsp; //29 | 面试题：二叉树的最大和最小深度 =====&gt; 最小深度参见 3 <a href="https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/solution/php-shen-du-you-xian-bian-li-di-gui-by-william-nin/" rel="nofollow">https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/solution/php-shen-du-you-xian-bian-li-di-gui-by-william-nin/</a>&nbsp; &nbsp;//个人题解 <a href="https://blog.csdn.net/william_n/article/details/109106814" rel="nofollow">https://blog.csdn.net/william_n/article/details/109106814</a>&nbsp; //资料学习 &nbsp; 4.206 题.&nbsp;<a href="https://leetcode-cn.com/problems/reverse-linked-list/" rel="nofollow">反转链表</a>&nbsp;-- 20201019&nbsp;周一&nbsp; 家里 <a href="https://time.geekbang.org/course/detail/100019701-41547" rel="nofollow">https://time.geekbang.org/course/detail/100019701-41547</a> <a href="https://leetcode-cn.com/problems/reverse-linked-list/solution/php-die-dai-zhi-zhen-fan-zhuan-by-william-ning/" rel="nofollow">https://leetcode-cn.com/problems/reverse-linked-list/solution/php-die-dai-zhi-zhen-fan-zhuan-by-william-ning/</a> &nbsp; 5.141 题<a href="https://leetcode-cn.com/problems/linked-list-cycle/" rel="nofollow">. 环形链表</a>&nbsp; --&nbsp;20201020&nbsp;周二&nbsp; 科学馆 <a href="https://time.geekbang.org/course/detail/100019701-41547" rel="nofollow">https://time.geekbang.org/course/detail/100019701-41547</a> <a href="https://leetcode-cn.com/problems/linked-list-cycle/solution/php-sethash-kuai-man-zhi-zhen-liang-chong-fang-shi/" rel="nofollow">https://leetcode-cn.com/problems/linked-list-cycle/solution/php-sethash-kuai-man-zhi-zhen-liang-chong-fang-shi/</a>&nbsp;//个人题解 补充 <a href="https://leetcode-cn.com/problems/linked-list-cycle-lcci/" rel="nofollow">面试题 02.08. 环路检测</a>&nbsp;-- 20210304&nbsp;家里 &nbsp; 6.20 题<a href="https://leetcode-cn.com/problems/valid-parentheses/" rel="nofollow">. 有效的括号</a> <a href="https://leetcode-cn.com/problems/valid-parentheses/submissions/" rel="nofollow">https://leetcode-cn.com/problems/valid-parentheses/submissions/</a> &nbsp; 7.array 系列 剑指 Offer 03.&nbsp;&nbsp;<a href="https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/submissions/" rel="nofollow">https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/submissions/</a>&nbsp; //&nbsp;. 数组中重复的数字 &nbsp; 8.&nbsp;<a href="https://leetcode-cn.com/problems/swap-nodes-in-pairs/" rel="nofollow">24. 两两交换链表中的节点</a>&nbsp;-- 20210302 家里 <a href="https://leetcode-cn.com/problems/swap-nodes-in-pairs/submissions/" rel="nofollow">https://leetcode-cn.com/problems/swap-nodes-in-pairs/submissions/</a> <a href="https://leetcode-cn.com/problems/swap-nodes-in-pairs/solution/jiao-huan-zhi-di-gui-die-dai-by-william-rjc9b/" rel="nofollow">https://leetcode-cn.com/problems/swap-nodes-in-pairs/solution/jiao-huan-zhi-di-gui-die-dai-by-william-rjc9b/</a>&nbsp; &nbsp;// 简要题解 &nbsp; 9.&nbsp;剑指 Offer 22. 链表中倒数第k个节点&nbsp; &nbsp;---&nbsp;20210310&nbsp;家里+公司 面试题 02.02. 返回倒数第 k 个节点 <a href="https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/" rel="nofollow">https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/</a>&nbsp; // 同下 思路是完全一样的 <a href="https://leetcode-cn.com/problems/kth-node-from-end-of-list-lcci/solution/zhu-yao-liang-chong-fang-shi-kuai-man-zh-eq2y/" rel="nofollow">https://leetcode-cn.com/problems/kth-node-from-end-of-list-lcci/solution/zhu-yao-liang-chong-fang-shi-kuai-man-zh-eq2y/</a>&nbsp; // 简要题解 &nbsp; 10.&nbsp;<a href="https://leetcode-cn.com/problems/merge-two-sorted-lists/" rel="nofollow">21. 合并两个有序链表</a>&nbsp; &nbsp;&nbsp;---&nbsp;20210311&nbsp;家里 <a href="https://leetcode-cn.com/problems/merge-two-sorted-lists/solution/php-di-gui-die-dai-by-william-ning-0khy/" rel="nofollow">https://leetcode-cn.com/problems/merge-two-sorted-lists/solution/php-di-gui-die-dai-by-william-ning-0khy/</a>&nbsp; &nbsp;// 简要题解 &nbsp; 11.&nbsp;19. 链表的倒数第 N 个结点&nbsp;&nbsp;&nbsp;---&nbsp;20210312&nbsp;公司 <a href="https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/solution/php-kuai-man-zhi-zhen-by-william-ning-lva8/" rel="nofollow">https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/solution/php-kuai-man-zhi-zhen-by-william-ning-lva8/</a>&nbsp; &nbsp;//&nbsp;简要题解 &nbsp; 12.&nbsp;&nbsp;876. 链表的中间结点&nbsp;&nbsp;---&nbsp;20210316&nbsp;公司 <a href="https://leetcode-cn.com/problems/middle-of-the-linked-list/solution/php-kuai-man-zhi-zhen-xun-huan-bian-li-b-57za/" rel="nofollow">https://leetcode-cn.com/problems/middle-of-the-linked-list/solution/php-kuai-man-zhi-zhen-xun-huan-bian-li-b-57za/</a>&nbsp; &nbsp;//&nbsp;简要题解 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 后续补充 ... </td> 
 </tr> 
 </tbody> 
</table>

3.问题/补充

4.参考

<table> 
 <tbody> 
 <tr> 
 <td> <a href="https://blog.csdn.net/william_n/article/details/114144052" rel="nofollow">https://blog.csdn.net/william_n/article/details/114144052</a>&nbsp;// PHP - 链表 - 构造 <a href="https://blog.csdn.net/william_n/article/details/109106814" rel="nofollow">https://blog.csdn.net/william_n/article/details/109106814</a>&nbsp; //&nbsp;PHP - 二叉树 - 构造 </td> 
 </tr> 
 </tbody> 
</table>

后续补充

...

![这里写图片描述][aHR0cDovL2ltZy5ibG9nLmNzZG4ubmV0LzIwMTgwMTMxMTE0ODQ0Mjg2]

[aHR0cDovL2ltZy5ibG9nLmNzZG4ubmV0LzIwMTgwMTMxMTE0ODQ0Mjg2]: /images/20221123/864199b394504df88aa42ae9882de592.png