update美团至牛客2021.4.23面经

README.md

@@ -23,7 +23,19 @@
 
 :warning:若转载文章，需注明本仓库地址
 
-## 腾讯（更新牛客21.1.1~21.4.12日的面经）
+## 美团（更新至牛客2021.4.23号面经）
+<details>
+<summary>按岗位分类</summary>
+
+- [后端](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/backend.md)
+- [算法](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/algorithm.md)
+- [客户端](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/client.md)
+- [前端](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/frontend.md)
+- [测试](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/test.md)
+- [数据开发](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/data.md)
+</details>
+
+## 腾讯（更新至牛客21.4.12日的面经）
 <details>
 <summary>按岗位分类</summary>
 
@@ -46,18 +58,6 @@
 - [测试](https://github.com/afatcoder/LeetcodeTop/blob/master/bytedance/test.md)
 </details>
 
-## 美团（牛客2020.8.15~牛客2021.3.30号面经）
-<details>
-<summary>按岗位分类</summary>
-
-- [后端](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/backend.md)
-- [算法](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/algorithm.md)
-- [客户端](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/client.md)
-- [前端](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/frontend.md)
-- [测试](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/test.md)
-- [数据开发](https://github.com/afatcoder/LeetcodeTop/blob/master/meituan/data.md)
-</details>
-
 ## 微软（更新至牛客3.20日的面经）
 - [SDE](https://github.com/afatcoder/LeetcodeTop/blob/master/microsoft/SDE.md)
 

meituan/algorithm.md

@@ -1,22 +1,37 @@
 # 算法
 若想按部门/难度/题型筛选题目，请进入[CodeTop](https://codetop.cc)查询
+
 |题目|出现次数|链接|
 |-|-|-|
-|补充题4. 手撕快速排序|4|https://leetcode-cn.com/problems/sort-an-array|
-|121. 买卖股票的最佳时机|3|https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock|
+|补充题4. 手撕快速排序|5|https://leetcode-cn.com/problems/sort-an-array|
+|121. 买卖股票的最佳时机|4|https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock|
+|215. 数组中的第K个最大元素|4|https://leetcode-cn.com/problems/kth-largest-element-in-an-array|
 |128. 最长连续序列|2|https://leetcode-cn.com/problems/longest-consecutive-sequence|
+|1143. 最长公共子序列|2|https://leetcode-cn.com/problems/longest-common-subsequence|
+|498. 对角线遍历|2|https://leetcode-cn.com/problems/diagonal-traverse|
 |剑指 Offer 65. 不用加减乘除做加法|2|https://leetcode-cn.com/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof|
-|215. 数组中的第K个最大元素|2|https://leetcode-cn.com/problems/kth-largest-element-in-an-array|
+|53. 最大子序和|2|https://leetcode-cn.com/problems/maximum-subarray|
+|2. 两数相加|2|https://leetcode-cn.com/problems/add-two-numbers|
+|718. 最长重复子数组|2|https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray|
 |21. 合并两个有序链表|1|https://leetcode-cn.com/problems/merge-two-sorted-lists|
+|560. 和为K的子数组|1|https://leetcode-cn.com/problems/subarray-sum-equals-k|
+|5. 最长回文子串|1|https://leetcode-cn.com/problems/longest-palindromic-substring|
+|20. 有效的括号|1|https://leetcode-cn.com/problems/valid-parentheses|
+|94. 二叉树的中序遍历|1|https://leetcode-cn.com/problems/binary-tree-inorder-traversal|
+|104. 二叉树的最大深度|1|https://leetcode-cn.com/problems/maximum-depth-of-binary-tree|
+|69. x 的平方根|1|https://leetcode-cn.com/problems/sqrtx|
+|240. 搜索二维矩阵 II|1|https://leetcode-cn.com/problems/search-a-2d-matrix-ii|
+|76. 最小覆盖子串|1|https://leetcode-cn.com/problems/minimum-window-substring|
+|143. 重排链表|1|https://leetcode-cn.com/problems/reorder-list|
+|103. 二叉树的锯齿形层次遍历|1|https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal|
+|208. 实现 Trie (前缀树)|1|https://leetcode-cn.com/problems/implement-trie-prefix-tree|
 |3. 无重复字符的最长子串|1|https://leetcode-cn.com/problems/longest-substring-without-repeating-characters|
 |50. Pow(x, n)|1|https://leetcode-cn.com/problems/powx-n|
 |7. 整数反转|1|https://leetcode-cn.com/problems/reverse-integer|
 |410. 分割数组的最大值|1|https://leetcode-cn.com/problems/split-array-largest-sum|
 |25. K 个一组翻转链表|1|https://leetcode-cn.com/problems/reverse-nodes-in-k-group|
 |146. LRU缓存机制|1|https://leetcode-cn.com/problems/lru-cache|
 |15. 三数之和|1|https://leetcode-cn.com/problems/3sum|
-|718. 最长重复子数组|1|https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray|
-|2. 两数相加|1|https://leetcode-cn.com/problems/add-two-numbers|
 |226. 翻转二叉树|1|https://leetcode-cn.com/problems/invert-binary-tree|
 |剑指 Offer 40. 最小的k个数|1|https://leetcode-cn.com/problems/zui-xiao-de-kge-shu-lcof|
 |73. 矩阵置零|1|https://leetcode-cn.com/problems/set-matrix-zeroes|