mirror of https://github.com/doocs/leetcode.git
docs: update summary and sidebar
This commit is contained in:
yanglbme
parent
2de0a9d328
commit
a1dca795b7
20
index.html
20
index.html
|
|
@ -24,6 +24,11 @@
|
|||
<body>
|
||||
<div id="app">LeetCode & Coding Interview Guide @Doocs</div>
|
||||
<script>
|
||||
const isEn = () => location.hash.includes('README_EN');
|
||||
window.addEventListener('hashchange', () => {
|
||||
window.$docsify.loadSidebar = isEn() ? 'summary_en.md' : 'summary.md'
|
||||
});
|
||||
|
||||
window.$docsify = {
|
||||
name: 'leetcode',
|
||||
repo: 'doocs/leetcode',
|
||||
|
|
@ -31,7 +36,7 @@
|
|||
search: [
|
||||
'/', '/solution/', '/lcof/', '/lcof2/', '/lcci/', '/lcs/', '/lcp/', '/basic/'
|
||||
],
|
||||
loadSidebar: 'summary.md',
|
||||
loadSidebar: isEn() ? 'summary_en.md' : 'summary.md',
|
||||
auto2top: true,
|
||||
subMaxLevel: 2,
|
||||
alias: {
|
||||
|
|
@ -41,7 +46,15 @@
|
|||
'/lcof/.*/summary.md': '/lcof/summary.md',
|
||||
'/lcof2/.*/summary.md': '/lcof2/summary.md',
|
||||
'/solution/.*/summary.md': '/solution/summary.md',
|
||||
'/basic/.*/summary.md': '/basic/summary.md'
|
||||
'/basic/.*/summary.md': '/basic/summary.md',
|
||||
|
||||
'/lcs/.*/summary_en.md': '/lcs/summary_en.md',
|
||||
'/lcp/.*/summary_en.md': '/lcp/summary_en.md',
|
||||
'/lcci/.*/summary_en.md': '/lcci/summary_en.md',
|
||||
'/lcof/.*/summary_en.md': '/lcof/summary_en.md',
|
||||
'/lcof2/.*/summary_en.md': '/lcof2/summary_en.md',
|
||||
'/solution/.*/summary_en.md': '/solution/summary_en.md',
|
||||
'/basic/.*/summary_en.md': '/basic/summary_en.md',
|
||||
},
|
||||
contributors: {
|
||||
repo: 'doocs/leetcode',
|
||||
|
|
@ -81,9 +94,6 @@
|
|||
},
|
||||
plugins: [
|
||||
(hook, vm) => {
|
||||
|
||||
const isEn = () => vm.route.file.includes('README_EN')
|
||||
|
||||
hook.beforeEach((html) => {
|
||||
const {file} = vm.route
|
||||
const userContent = /githubusercontent\.com/.test(file)
|
||||
|
|
|
|||
|
|
@ -0,0 +1,76 @@
|
|||
- LCOF Solutions
|
||||
- [03. 数组中重复的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9803.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
|
||||
- [04. 二维数组中的查找](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9804.%20%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE/README.md)
|
||||
- [05. 替换空格](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9805.%20%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC/README.md)
|
||||
- [06. 从尾到头打印链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9806.%20%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8/README.md)
|
||||
- [07. 重建二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9807.%20%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
|
||||
- [09. 用两个栈实现队列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9809.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97/README.md)
|
||||
- [10- I. 斐波那契数列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20I.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97/README.md)
|
||||
- [10- II. 青蛙跳台阶问题](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20II.%20%E9%9D%92%E8%9B%99%E8%B7%B3%E5%8F%B0%E9%98%B6%E9%97%AE%E9%A2%98/README.md)
|
||||
- [11. 旋转数组的最小数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9811.%20%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97/README.md)
|
||||
- [12. 矩阵中的路径](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9812.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84/README.md)
|
||||
- [13. 机器人的运动范围](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9813.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4/README.md)
|
||||
- [14- I. 剪绳子](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20I.%20%E5%89%AA%E7%BB%B3%E5%AD%90/README.md)
|
||||
- [14- II. 剪绳子 II](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20II.%20%E5%89%AA%E7%BB%B3%E5%AD%90%20II/README.md)
|
||||
- [15. 二进制中 1 的个数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9815.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0/README.md)
|
||||
- [16. 数值的整数次方](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9816.%20%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9/README.md)
|
||||
- [17. 打印从 1 到最大的 n 位数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9817.%20%E6%89%93%E5%8D%B0%E4%BB%8E1%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84n%E4%BD%8D%E6%95%B0/README.md)
|
||||
- [18. 删除链表的节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9818.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E8%8A%82%E7%82%B9/README.md)
|
||||
- [19. 正则表达式匹配](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9819.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D/README.md)
|
||||
- [20. 表示数值的字符串](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9820.%20%E8%A1%A8%E7%A4%BA%E6%95%B0%E5%80%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md)
|
||||
- [21. 调整数组顺序使奇数位于偶数前面](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9821.%20%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2/README.md)
|
||||
- [22. 链表中倒数第 k 个节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9822.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9/README.md)
|
||||
- [24. 反转链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9824.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8/README.md)
|
||||
- [25. 合并两个排序的链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9825.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%8E%92%E5%BA%8F%E7%9A%84%E9%93%BE%E8%A1%A8/README.md)
|
||||
- [26. 树的子结构](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9826.%20%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84/README.md)
|
||||
- [27. 二叉树的镜像](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9827.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F/README.md)
|
||||
- [28. 对称的二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9828.%20%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
|
||||
- [29. 顺时针打印矩阵](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9829.%20%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5/README.md)
|
||||
- [30. 包含 min 函数的栈](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9830.%20%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88/README.md)
|
||||
- [31. 栈的压入、弹出序列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9831.%20%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E3%80%81%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97/README.md)
|
||||
- [32 - I. 从上到下打印二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20I.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
|
||||
- [32 - II. 从上到下打印二叉树 II](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20II.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20II/README.md)
|
||||
- [32 - III. 从上到下打印二叉树 III](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III/README.md)
|
||||
- [33. 二叉搜索树的后序遍历序列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9833.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97/README.md)
|
||||
- [34. 二叉树中和为某一值的路径](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9834.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%92%8C%E4%B8%BA%E6%9F%90%E4%B8%80%E5%80%BC%E7%9A%84%E8%B7%AF%E5%BE%84/README.md)
|
||||
- [35. 复杂链表的复制](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9835.%20%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6/README.md)
|
||||
- [36. 二叉搜索树与双向链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9836.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%8E%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8/README.md)
|
||||
- [37. 序列化二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9837.%20%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
|
||||
- [38. 字符串的排列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9838.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97/README.md)
|
||||
- [39. 数组中出现次数超过一半的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9839.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E8%B6%85%E8%BF%87%E4%B8%80%E5%8D%8A%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
|
||||
- [40. 最小的 k 个数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9840.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0/README.md)
|
||||
- [41. 数据流中的中位数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9841.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0/README.md)
|
||||
- [42. 连续子数组的最大和](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9842.%20%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C/README.md)
|
||||
- [43. 1 ～ n 整数中 1 出现的次数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9843.%201%EF%BD%9En%E6%95%B4%E6%95%B0%E4%B8%AD1%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0/README.md)
|
||||
- [44. 数字序列中某一位的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9844.%20%E6%95%B0%E5%AD%97%E5%BA%8F%E5%88%97%E4%B8%AD%E6%9F%90%E4%B8%80%E4%BD%8D%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
|
||||
- [45. 把数组排成最小的数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9845.%20%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0/README.md)
|
||||
- [46. 把数字翻译成字符串](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9846.%20%E6%8A%8A%E6%95%B0%E5%AD%97%E7%BF%BB%E8%AF%91%E6%88%90%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md)
|
||||
- [47. 礼物的最大价值](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9847.%20%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC/README.md)
|
||||
- [48. 最长不含重复字符的子字符串](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9848.%20%E6%9C%80%E9%95%BF%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md)
|
||||
- [49. 丑数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9849.%20%E4%B8%91%E6%95%B0/README.md)
|
||||
- [50. 第一个只出现一次的字符](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9850.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6/README.md)
|
||||
- [51. 数组中的逆序对](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9851.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9/README.md)
|
||||
- [52. 两个链表的第一个公共节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9852.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%85%AC%E5%85%B1%E8%8A%82%E7%82%B9/README.md)
|
||||
- [53 - I. 在排序数组中查找数字 I](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20I.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E6%95%B0%E5%AD%97%20I/README.md)
|
||||
- [53 - II. 0 ～ n-1 中缺失的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20II.%200%EF%BD%9En-1%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
|
||||
- [54. 二叉搜索树的第 k 大节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9854.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9/README.md)
|
||||
- [55 - I. 二叉树的深度](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6/README.md)
|
||||
- [55 - II. 平衡二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20II.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
|
||||
- [56 - I. 数组中数字出现的次数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20I.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0/README.md)
|
||||
- [56 - II. 数组中数字出现的次数 II](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20II.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0%20II/README.md)
|
||||
- [57. 和为 s 的两个数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97/README.md)
|
||||
- [57 - II. 和为 s 的连续正数序列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857%20-%20II.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%AD%A3%E6%95%B0%E5%BA%8F%E5%88%97/README.md)
|
||||
- [58 - I. 翻转单词顺序](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20I.%20%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E9%A1%BA%E5%BA%8F/README.md)
|
||||
- [58 - II. 左旋转字符串](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20II.%20%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md)
|
||||
- [59 - I. 滑动窗口的最大值](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9859%20-%20I.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC/README.md)
|
||||
- [59 - II. 队列的最大值](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9859%20-%20II.%20%E9%98%9F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC/README.md)
|
||||
- [60. n 个骰子的点数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9860.%20n%E4%B8%AA%E9%AA%B0%E5%AD%90%E7%9A%84%E7%82%B9%E6%95%B0/README.md)
|
||||
- [61. 扑克牌中的顺子](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9861.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90/README.md)
|
||||
- [62. 圆圈中最后剩下的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9862.%20%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
|
||||
- [63. 股票的最大利润](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9863.%20%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6/README.md)
|
||||
- [64. 求 1+2+…+n](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9864.%20%E6%B1%821%2B2%2B%E2%80%A6%2Bn/README.md)
|
||||
- [65. 不用加减乘除做加法](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9865.%20%E4%B8%8D%E7%94%A8%E5%8A%A0%E5%87%8F%E4%B9%98%E9%99%A4%E5%81%9A%E5%8A%A0%E6%B3%95/README.md)
|
||||
- [66. 构建乘积数组](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9866.%20%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84/README.md)
|
||||
- [67. 把字符串转换成整数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9867.%20%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%88%90%E6%95%B4%E6%95%B0/README.md)
|
||||
- [68 - I. 二叉搜索树的最近公共祖先](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/README.md)
|
||||
- [68 - II. 二叉树的最近公共祖先](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20II.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/README.md)
|
||||
|
|
@ -0,0 +1,50 @@
|
|||
- LCP Solutions
|
||||
- [LCP 01. 猜数字](/lcp/LCP%2001.%20%E7%8C%9C%E6%95%B0%E5%AD%97/README.md)
|
||||
- [LCP 02. 分式化简](/lcp/LCP%2002.%20%E5%88%86%E5%BC%8F%E5%8C%96%E7%AE%80/README.md)
|
||||
- [LCP 03. 机器人大冒险](/lcp/LCP%2003.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E5%A4%A7%E5%86%92%E9%99%A9/README.md)
|
||||
- [LCP 04. 覆盖](/lcp/LCP%2004.%20%E8%A6%86%E7%9B%96/README.md)
|
||||
- [LCP 05. 发 LeetCoin](/lcp/LCP%2005.%20%E5%8F%91%20LeetCoin/README.md)
|
||||
- [LCP 06. 拿硬币](/lcp/LCP%2006.%20%E6%8B%BF%E7%A1%AC%E5%B8%81/README.md)
|
||||
- [LCP 07. 传递信息](/lcp/LCP%2007.%20%E4%BC%A0%E9%80%92%E4%BF%A1%E6%81%AF/README.md)
|
||||
- [LCP 08. 剧情触发时间](/lcp/LCP%2008.%20%E5%89%A7%E6%83%85%E8%A7%A6%E5%8F%91%E6%97%B6%E9%97%B4/README.md)
|
||||
- [LCP 09. 最小跳跃次数](/lcp/LCP%2009.%20%E6%9C%80%E5%B0%8F%E8%B7%B3%E8%B7%83%E6%AC%A1%E6%95%B0/README.md)
|
||||
- [LCP 10. 二叉树任务调度](/lcp/LCP%2010.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%BB%BB%E5%8A%A1%E8%B0%83%E5%BA%A6/README.md)
|
||||
- [LCP 11. 期望个数统计](/lcp/LCP%2011.%20%E6%9C%9F%E6%9C%9B%E4%B8%AA%E6%95%B0%E7%BB%9F%E8%AE%A1/README.md)
|
||||
- [LCP 12. 小张刷题计划](/lcp/LCP%2012.%20%E5%B0%8F%E5%BC%A0%E5%88%B7%E9%A2%98%E8%AE%A1%E5%88%92/README.md)
|
||||
- [LCP 13. 寻宝](/lcp/LCP%2013.%20%E5%AF%BB%E5%AE%9D/README.md)
|
||||
- [LCP 14. 切分数组](/lcp/LCP%2014.%20%E5%88%87%E5%88%86%E6%95%B0%E7%BB%84/README.md)
|
||||
- [LCP 15. 游乐园的迷宫](/lcp/LCP%2015.%20%E6%B8%B8%E4%B9%90%E5%9B%AD%E7%9A%84%E8%BF%B7%E5%AE%AB/README.md)
|
||||
- [LCP 16. 游乐园的游览计划](/lcp/LCP%2016.%20%E6%B8%B8%E4%B9%90%E5%9B%AD%E7%9A%84%E6%B8%B8%E8%A7%88%E8%AE%A1%E5%88%92/README.md)
|
||||
- [LCP 17. 速算机器人](/lcp/LCP%2017.%20%E9%80%9F%E7%AE%97%E6%9C%BA%E5%99%A8%E4%BA%BA/README.md)
|
||||
- [LCP 18. 早餐组合](/lcp/LCP%2018.%20%E6%97%A9%E9%A4%90%E7%BB%84%E5%90%88/README.md)
|
||||
- [LCP 19. 秋叶收藏集](/lcp/LCP%2019.%20%E7%A7%8B%E5%8F%B6%E6%94%B6%E8%97%8F%E9%9B%86/README.md)
|
||||
- [LCP 20. 快速公交](/lcp/LCP%2020.%20%E5%BF%AB%E9%80%9F%E5%85%AC%E4%BA%A4/README.md)
|
||||
- [LCP 21. 追逐游戏](/lcp/LCP%2021.%20%E8%BF%BD%E9%80%90%E6%B8%B8%E6%88%8F/README.md)
|
||||
- [LCP 22. 黑白方格画](/lcp/LCP%2022.%20%E9%BB%91%E7%99%BD%E6%96%B9%E6%A0%BC%E7%94%BB/README.md)
|
||||
- [LCP 23. 魔术排列](/lcp/LCP%2023.%20%E9%AD%94%E6%9C%AF%E6%8E%92%E5%88%97/README.md)
|
||||
- [LCP 24. 数字游戏](/lcp/LCP%2024.%20%E6%95%B0%E5%AD%97%E6%B8%B8%E6%88%8F/README.md)
|
||||
- [LCP 25. 古董键盘](/lcp/LCP%2025.%20%E5%8F%A4%E8%91%A3%E9%94%AE%E7%9B%98/README.md)
|
||||
- [LCP 26. 导航装置](/lcp/LCP%2026.%20%E5%AF%BC%E8%88%AA%E8%A3%85%E7%BD%AE/README.md)
|
||||
- [LCP 27. 黑盒光线反射](/lcp/LCP%2027.%20%E9%BB%91%E7%9B%92%E5%85%89%E7%BA%BF%E5%8F%8D%E5%B0%84/README.md)
|
||||
- [LCP 28. 采购方案](/lcp/LCP%2028.%20%E9%87%87%E8%B4%AD%E6%96%B9%E6%A1%88/README.md)
|
||||
- [LCP 29. 乐团站位](/lcp/LCP%2029.%20%E4%B9%90%E5%9B%A2%E7%AB%99%E4%BD%8D/README.md)
|
||||
- [LCP 30. 魔塔游戏](/lcp/LCP%2030.%20%E9%AD%94%E5%A1%94%E6%B8%B8%E6%88%8F/README.md)
|
||||
- [LCP 31. 变换的迷宫](/lcp/LCP%2031.%20%E5%8F%98%E6%8D%A2%E7%9A%84%E8%BF%B7%E5%AE%AB/README.md)
|
||||
- [LCP 32. 批量处理任务](/lcp/LCP%2032.%20%E6%89%B9%E9%87%8F%E5%A4%84%E7%90%86%E4%BB%BB%E5%8A%A1/README.md)
|
||||
- [LCP 33. 蓄水](/lcp/LCP%2033.%20%E8%93%84%E6%B0%B4/README.md)
|
||||
- [LCP 34. 二叉树染色](/lcp/LCP%2034.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9F%93%E8%89%B2/README.md)
|
||||
- [LCP 35. 电动车游城市](/lcp/LCP%2035.%20%E7%94%B5%E5%8A%A8%E8%BD%A6%E6%B8%B8%E5%9F%8E%E5%B8%82/README.md)
|
||||
- [LCP 36. 最多牌组数](/lcp/LCP%2036.%20%E6%9C%80%E5%A4%9A%E7%89%8C%E7%BB%84%E6%95%B0/README.md)
|
||||
- [LCP 37. 最小矩形面积](/lcp/LCP%2037.%20%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF/README.md)
|
||||
- [LCP 38. 守卫城堡](/lcp/LCP%2038.%20%E5%AE%88%E5%8D%AB%E5%9F%8E%E5%A0%A1/README.md)
|
||||
- [LCP 39. 无人机方阵](/lcp/LCP%2039.%20%E6%97%A0%E4%BA%BA%E6%9C%BA%E6%96%B9%E9%98%B5/README.md)
|
||||
- [LCP 40. 心算挑战](/lcp/LCP%2040.%20%E5%BF%83%E7%AE%97%E6%8C%91%E6%88%98/README.md)
|
||||
- [LCP 41. 黑白翻转棋](/lcp/LCP%2041.%20%E9%BB%91%E7%99%BD%E7%BF%BB%E8%BD%AC%E6%A3%8B/README.md)
|
||||
- [LCP 42. 玩具套圈](/lcp/LCP%2042.%20%E7%8E%A9%E5%85%B7%E5%A5%97%E5%9C%88/README.md)
|
||||
- [LCP 43. 十字路口的交通](/lcp/LCP%2043.%20%E5%8D%81%E5%AD%97%E8%B7%AF%E5%8F%A3%E7%9A%84%E4%BA%A4%E9%80%9A/README.md)
|
||||
- [LCP 44. 开幕式焰火](/lcp/LCP%2044.%20%E5%BC%80%E5%B9%95%E5%BC%8F%E7%84%B0%E7%81%AB/README.md)
|
||||
- [LCP 45. 自行车炫技赛场](/lcp/LCP%2045.%20%E8%87%AA%E8%A1%8C%E8%BD%A6%E7%82%AB%E6%8A%80%E8%B5%9B%E5%9C%BA/README.md)
|
||||
- [LCP 46. 志愿者调配](/lcp/LCP%2046.%20%E5%BF%97%E6%84%BF%E8%80%85%E8%B0%83%E9%85%8D/README.md)
|
||||
- [LCP 47. 入场安检](/lcp/LCP%2047.%20%E5%85%A5%E5%9C%BA%E5%AE%89%E6%A3%80/README.md)
|
||||
- [LCP 48. 无限棋局](/lcp/LCP%2048.%20%E6%97%A0%E9%99%90%E6%A3%8B%E5%B1%80/README.md)
|
||||
- [LCP 49. 环形闯关游戏](/lcp/LCP%2049.%20%E7%8E%AF%E5%BD%A2%E9%97%AF%E5%85%B3%E6%B8%B8%E6%88%8F/README.md)
|
||||
|
|
@ -0,0 +1,4 @@
|
|||
- LCS Solutions
|
||||
- [LCS 01. 下载插件](/lcs/LCS%2001.%20%E4%B8%8B%E8%BD%BD%E6%8F%92%E4%BB%B6/README.md)
|
||||
- [LCS 02. 完成一半题目](/lcs/LCS%2002.%20%E5%AE%8C%E6%88%90%E4%B8%80%E5%8D%8A%E9%A2%98%E7%9B%AE/README.md)
|
||||
- [LCS 03. 主题空间](/lcs/LCS%2003.%20%E4%B8%BB%E9%A2%98%E7%A9%BA%E9%97%B4/README.md)
|
||||
|
|
@ -316,6 +316,11 @@ class LCSpider:
|
|||
"""generate summary files"""
|
||||
summary_cn = ''
|
||||
summary_en = ''
|
||||
|
||||
with open('./result.json', 'r', encoding='utf-8') as f:
|
||||
result = f.read()
|
||||
result = json.loads(result)
|
||||
m = {int(item['frontend_question_id']):item for item in result}
|
||||
for file in os.listdir('./'):
|
||||
if os.path.isdir("./" + file) and file != '__pycache__':
|
||||
summary_cn += f'\n- {file}\n'
|
||||
|
|
@ -323,7 +328,13 @@ class LCSpider:
|
|||
for sub in os.listdir('./' + file):
|
||||
sub = sub.replace('`', ' ')
|
||||
enc = quote(sub)
|
||||
summary_cn += f' - [{sub}](/solution/{file}/{enc}/README.md)\n'
|
||||
|
||||
data = m.get(int(sub[:4]))
|
||||
sub_cn = sub
|
||||
if data:
|
||||
sub_cn = sub[:5] + data['title_cn']
|
||||
|
||||
summary_cn += f' - [{sub_cn}](/solution/{file}/{enc}/README.md)\n'
|
||||
summary_en += f' - [{sub}](/solution/{file}/{enc}/README_EN.md)\n'
|
||||
|
||||
# generate summary.md
|
||||
|
|
|
|||
4390
solution/summary.md
4390
solution/summary.md
File diff suppressed because it is too large
Load Diff
Loading…
Reference in New Issue