面试算法题及技巧.zip

✅ [ACM 模式输入输出](https://labfiles.acmcoder.com/ojhtml/index.html#/?id=js%e8%af%bb%e5%8f%96%e8%b6%85%e9%95%bf%e5%ad%97%e7%ac%a6%e4%b8%b2) # 刷题记录 ## 二叉树 - [x] [226. 翻转二叉树](https://leetcode-cn.com/problems/invert-binary-tree/) - [x] [101. 对称二叉树](https://leetcode-cn.com/problems/symmetric-tree/) ★★ - [x] [222. 完全二叉树的节点个数](https://leetcode-cn.com/problems/count-complete-tree-nodes/) - [x] [257. 二叉树的所有路径](https://leetcode-cn.com/problems/binary-tree-paths/) [回溯] - [x] [404. 左叶子之和](https://leetcode-cn.com/problems/sum-of-left-leaves/) ★★ - [x] [112. 路径总和](https://leetcode-cn.com/problems/path-sum/) ★★ - [x] [113. 路径总和 II](https://leetcode-cn.com/problems/path-sum-ii/) ★★★ - [x] [617. 合并二叉树](https://leetcode-cn.com/problems/merge-two-binary-trees/) - [x] [236. 二叉树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/) ## 二叉树遍历(深度优先) - [x] [144. 二叉树的前序遍历](https://leetcode-cn.com/problems/binary-tree-preorder-traversal/) - [x] [145. 二叉树的后序遍历](https://leetcode-cn.com/problems/binary-tree-postorder-traversal/) - [x] [94. 二叉树的中序遍历](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/) ## 二叉树层序遍历(广度优先) - [x] [102. 二叉树的层序遍历](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/) - [x] [107. 二叉树的层序遍历 II](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/) - [x] [199. 二叉树的右视图](https://leetcode-cn.com/problems/binary-tree-right-side-view/) - [x] [637. 二叉树的层平均值](https://leetcode-cn.com/problems/average-of-levels-in-binary-tree/) - [x] [429. N 叉树的层序遍历](https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/) - [x] [515. 在每个树行中找最大值](https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/) - [x] [116. 填充每个节点的下一个右侧节点指针](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node/) - [x] [117. 填充每个节点的下一个右侧节点指针 II](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii/) - [x] [513. 找树左下角的值](https://leetcode-cn.com/problems/find-bottom-left-tree-value/) ## 二叉树深度/高度 - [x] [104. 二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/) - [x] [559. N 叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree/) ★★ - [x] [111. 二叉树的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/) ★★ - [x] [110. 平衡二叉树](https://leetcode-cn.com/problems/balanced-binary-tree/) ## 构造二叉树 参考：[构造二叉树系列](https://lucifer.ren/blog/2020/02/08/%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%93%E9%A2%98/) - [x] [106. 从中序与后序遍历序列构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) - [x] [105. 从前序与中序遍历序列构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) - [x] [889. 根据前序和后序遍历构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) ★★ - [x] [654. 最大二叉树](https://leetcode-cn.com/problems/maximum-binary-tree/) ## 二叉搜索树 - [x] [98. 验证二叉搜索树](https://leetcode-cn.com/problems/validate-binary-search-tree/) - [x] [700. 二叉搜索树中的搜索](https://leetcode-cn.com/problems/search-in-a-binary-search-tree/) - [x] [530. 二叉搜索树的最小绝对差](https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst/) - [x] [501. 二叉搜索树中的众数](https://leetcode-cn.com/problems/find-mode-in-binary-search-tree/) - [x] [235. 二叉搜索树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) - [x] [701. 二叉搜索树中的插入操作](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/) - [x] [450. 删除二叉搜索树中的节点](https://leetcode-cn.com/problems/delete-node-in-a-bst/) ★★★ - [x] [108. 将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/) # 回溯算法 ## 组合问题 - [x] [39. 组合总和](https://leetcode-cn.com/problems/combination-sum/) - [x] [40. 组合总和 II](https://leetcode-cn.com/problems/combination-sum-ii/) - [x] [216. 组合总和 III](https://leetcode-cn.com/problems/combination-sum-iii/) - [x] [77. 组合](https://leetcode-cn.com/problems/combinations/) - [x] [17. 电话号码的字母组合](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/) ## 排列问题 - [x] [46. 全排列](https://leetcode-cn.com/problems/permutations/) ★★ - [x] [47. 全排列 II](https://leetcode-cn.com/problems/permutations-ii/) ★★★ --- # 面试高频题 ## 简单题 - [x] [1. 两数之和](https://leetcode-cn.com/problems/two-sum/) - [x] [20. 有效的括号](https://leetcode-cn.com/problems/valid-parentheses/) - [x] [21. 合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists/) - [x] [26. 删除有序数组中的重复项](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/) - [x] [53. 最大子序和](https://leetcode-cn.com/problems/maximum-subarray/) - [x] [160. 相交链表](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/description/) - [x] [66. 加一](https://leetcode-cn.com/problems/plus-one/) - [x] [88. 合并两个有序数组](https://leetcode-cn.com/problems/merge-sorted-array/description/) - [x] [101. 对称二叉树](https://leetcode-cn.com/problems/symmetric-tree/description/) - [x] [104. 二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/description/) - [x] [108. 将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/description/) - [x] [121. 买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/description/) - [x] [122. 买卖股票的最佳时机 II](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/description/) - [x] [125. 验证回文串](https://leetcode-cn.com/problems/valid-palindrome/description/) - [x] [155. 最小栈](https://leetcode-cn.com/problems/min-stack/description/) ## 中等题 - [x] [2. 两数相加](https://leetcode-cn.com/problems/add-two-numbers/) - [x] [3. 无重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/) - [x] [5. 最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring/) - [x] [11. 盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water/) - [x] [15. 三数之和](https://leetcode-cn.com/problems/3sum/) - [x] [17. 电话号码的字母组合](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/) - [x] [19. 删除链表的倒数第 N 个结点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/) - [x] [22. 括号生成](https://leetcode-cn.com/problems/generate-parentheses/) - [x] [24. 两两交换链表中的节点](https://leetcode-cn.com/problems/swap-nodes-in-pairs/) - [x] [31. 下一个排列](https://leetcode-cn.com/problems/next-permutation/) - [x] [33. 搜索旋转排序数组](https://leetcode-cn.com/problems/search-in-rotated-sorted-array/description/) - [x] [39. 组合总和](https://leetcode-cn.com/problems/combination-sum/description/) - [x] [40. 组合总和 II](https://leetcode-cn.com/problems/combination-sum-ii/description/) - [x] [46. 全排列](https://leetcode-cn.com/problems/permutations/description/) - [x] [47.