|
1 |
| -| 公司| 岗位| 题目| 链接| 频度| |
2 |
| -|----|----|-------------------------------|----------------------------------------------------------------------------------------------------------------------|----| |
3 |
| -| 百度| 算法| 215\. 数组中的第K个最大元素|https://leetcode\-cn\.com/problems/kth\-largest\-element\-in\-an\-array/| 7| |
4 |
| -| 百度| 算法| 142\. 环形链表 II|https://leetcode\-cn\.com/problems/linked\-list\-cycle\-ii/| 2| |
5 |
| -| 百度| 算法| 103\. 二叉树的锯齿形层次遍历|https://leetcode\-cn\.com/problems/binary\-tree\-zigzag\-level\-order\-traversal/| 2| |
6 |
| -| 百度| 算法| 1339\. 分裂二叉树的最大乘积|https://leetcode\-cn\.com/problems/maximum\-product\-of\-splitted\-binary\-tree/| 1| |
7 |
| -| 百度| 算法| 101\. 对称二叉树|https://leetcode\-cn\.com/problems/symmetric\-tree/| 1| |
8 |
| -| 百度| 算法| 46\. 全排列|https://leetcode\-cn\.com/problems/permutations/| 1| |
9 |
| -| 百度| 算法| 53\. 最大子序和|https://leetcode\-cn\.com/problems/maximum\-subarray/| 1| |
10 |
| -| 百度| 算法| 98\. 验证二叉搜索树|https://leetcode\-cn\.com/problems/validate\-binary\-search\-tree/| 1| |
11 |
| -| 百度| 算法| 102\. 二叉树的层序遍历|https://leetcode\-cn\.com/problems/binary\-tree\-level\-order\-traversal/| 1| |
12 |
| -| 百度| 算法| 62\. 不同路径|https://leetcode\-cn\.com/problems/unique\-paths/| 1| |
13 |
| -| 百度| 算法| 69\. x 的平方根|https://leetcode\-cn\.com/problems/sqrtx/| 1| |
14 |
| -| 百度| 算法| 208\. 实现 Trie\(前缀树\)|https://leetcode\-cn\.com/problems/implement\-trie\-prefix\-tree/| 1| |
15 |
| -| 百度| 算法| 72\. 编辑距离|https://leetcode\-cn\.com/problems/edit\-distance/| 1| |
16 |
| -| 百度| 算法| 5\. 最长回文子串|https://leetcode\-cn\.com/problems/longest\-palindromic\-substring/| 1| |
17 |
| -| 百度| 算法| 206\. 反转链表|https://leetcode\-cn\.com/problems/reverse\-linked\-list/| 1| |
18 |
| -| 百度| 算法| 234\. 回文链表|https://leetcode\-cn\.com/problems/palindrome\-linked\-list/| 1| |
19 |
| -| 百度| 算法| 剑指 Offer 59\- I\. 滑动窗口的最大值|https://leetcode\-cn\.com/problems/hua\-dong\-chuang\-kou\-de\-zui\-da\-zhi\-lcof/| 1| |
20 |
| -| 百度| 算法| 404\. 左叶子之和|https://leetcode\-cn\.com/problems/sum\-of\-left\-leaves/| 1| |
21 |
| -| 百度| 算法| 剑指 Offer 21\. 调整数组顺序使奇数位于偶数前面|https://leetcode\-cn\.com/problems/diao\-zheng\-shu\-zu\-shun\-xu\-shi\-qi\-shu\-wei\-yu\-ou\-shu\-qian\-mian\-lcof/| 1| |
| 1 | +| 公司| 岗位| 题目| 链接| 频度| |
| 2 | +|----|----|------------------------------|-----------------------------------------------------------------------------------------------------|----| |
| 3 | +| 百度| 算法| 215. 数组中的第K个最大元素|https://leetcode-cn.com/problems/kth-largest-element-in-an-array/| 7| |
| 4 | +| 百度| 算法| 142. 环形链表 II|https://leetcode-cn.com/problems/linked-list-cycle-ii/| 2| |
| 5 | +| 百度| 算法| 103. 二叉树的锯齿形层次遍历|https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/| 2| |
| 6 | +| 百度| 算法| 1339. 分裂二叉树的最大乘积|https://leetcode-cn.com/problems/maximum-product-of-splitted-binary-tree/| 1| |
| 7 | +| 百度| 算法| 101. 对称二叉树|https://leetcode-cn.com/problems/symmetric-tree/| 1| |
| 8 | +| 百度| 算法| 46. 全排列|https://leetcode-cn.com/problems/permutations/| 1| |
| 9 | +| 百度| 算法| 53. 最大子序和|https://leetcode-cn.com/problems/maximum-subarray/| 1| |
| 10 | +| 百度| 算法| 98. 验证二叉搜索树|https://leetcode-cn.com/problems/validate-binary-search-tree/| 1| |
| 11 | +| 百度| 算法| 102. 二叉树的层序遍历|https://leetcode-cn.com/problems/binary-tree-level-order-traversal/| 1| |
| 12 | +| 百度| 算法| 62. 不同路径|https://leetcode-cn.com/problems/unique-paths/| 1| |
| 13 | +| 百度| 算法| 69. x 的平方根|https://leetcode-cn.com/problems/sqrtx/| 1| |
| 14 | +| 百度| 算法| 208. 实现 Trie (前缀树)|https://leetcode-cn.com/problems/implement-trie-prefix-tree/| 1| |
| 15 | +| 百度| 算法| 72. 编辑距离|https://leetcode-cn.com/problems/edit-distance/| 1| |
| 16 | +| 百度| 算法| 5. 最长回文子串|https://leetcode-cn.com/problems/longest-palindromic-substring/| 1| |
| 17 | +| 百度| 算法| 206. 反转链表|https://leetcode-cn.com/problems/reverse-linked-list/| 1| |
| 18 | +| 百度| 算法| 234. 回文链表|https://leetcode-cn.com/problems/palindrome-linked-list/| 1| |
| 19 | +| 百度| 算法| 剑指 Offer 59 - I. 滑动窗口的最大值|https://leetcode-cn.com/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/| 1| |
| 20 | +| 百度| 算法| 404. 左叶子之和|https://leetcode-cn.com/problems/sum-of-left-leaves/| 1| |
| 21 | +| 百度| 算法| 剑指 Offer 21. 调整数组顺序使奇数位于偶数前面|https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/| 1| |