Skip to content

Commit

Permalink
refactor: upgrade to docusaurus v3
Browse files Browse the repository at this point in the history
  • Loading branch information
YanceyOfficial committed Dec 9, 2023
1 parent 09720e2 commit 9b22407
Show file tree
Hide file tree
Showing 18 changed files with 2,746 additions and 1,823 deletions.
18 changes: 7 additions & 11 deletions .eslintrc
Original file line number Diff line number Diff line change
Expand Up @@ -4,9 +4,7 @@
"es6": true,
"node": true
},
"extends": [
"airbnb-base"
],
"extends": ["airbnb-base"],
"globals": {
"Atomics": "readonly",
"SharedArrayBuffer": "readonly"
Expand All @@ -16,9 +14,7 @@
"ecmaVersion": 2018,
"sourceType": "module"
},
"plugins": [
"@typescript-eslint"
],
"plugins": ["@typescript-eslint"],
"rules": {
"semi": "off",
"import/prefer-default-export": "off",
Expand All @@ -33,13 +29,13 @@
"no-param-reassign": "off",
"object-curly-newline": "off",
"import/extensions": "off",
"no-use-before-define": "off"
"no-use-before-define": "off",
"comma-dangle": "off",
"eol-last": "off"
},
"overrides": [
{
"files": [
"*.ts"
],
"files": ["*.ts"],
"rules": {
"@typescript-eslint/no-unused-vars": [
2,
Expand All @@ -51,4 +47,4 @@
}
}
]
}
}
5 changes: 1 addition & 4 deletions babel.config.js
Original file line number Diff line number Diff line change
@@ -1,6 +1,3 @@
module.exports = {
presets: [
require.resolve('@docusaurus/core/lib/babel/preset'),
'@babel/preset-typescript',
],
presets: [require.resolve('@docusaurus/core/lib/babel/preset')],
}
17 changes: 9 additions & 8 deletions docusaurus.config.js → docusaurus.config.ts
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
// @ts-check
// Note: type annotations allow type checking and IDEs autocompletion
import { themes as prismThemes } from 'prism-react-renderer'
import type { Config } from '@docusaurus/types'
import type * as Preset from '@docusaurus/preset-classic'

/** @type {import('@docusaurus/types').Config} */
module.exports = {
const config: Config = {
title: 'LeetCode Trip',
tagline: 'LeetCode Trip',
url: 'https://algorithm.yanceyleo.com',
Expand Down Expand Up @@ -62,8 +62,8 @@ module.exports = {
],
themeConfig: {
prism: {
// eslint-disable-next-line global-require
theme: require('prism-react-renderer/themes/vsDark'),
theme: prismThemes.vsDark,
darkTheme: prismThemes.vsDark,
additionalLanguages: ['rust'],
},
liveCodeBlock: {
Expand Down Expand Up @@ -129,11 +129,10 @@ module.exports = {
footer: {
copyright: `<a href="https://yanceyleo.com/legal/privacy-policy" target="_blank" rel="noopener noreferrer">Copyright © ${new Date().getFullYear()} Yancey Inc. and its affiliates.</a>`,
},
},
} satisfies Preset.ThemeConfig,
presets: [
[
'@docusaurus/preset-classic',
/** @type {import('@docusaurus/preset-classic').Options} */
{
docs: {
sidebarPath: require.resolve('./sidebars/sidebars'),
Expand All @@ -155,3 +154,5 @@ module.exports = {
],
],
}

export default config
8 changes: 4 additions & 4 deletions leetcode-docs/medium/137-single-number.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -20,9 +20,9 @@ keywords:

给你一个整数数组 nums, 除某个元素仅出现**一次**外, 其余每个元素都恰出现**三次**. 请你找出并返回那个只出现了一次的元素.

- 1 <= nums.length <= 3 \* 10<sup>4</sup>
- -2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1
- `nums 中, 除某个元素仅出现**一次**外, 其余每个元素都恰出现**三次**
- `1 <= nums.length <= 3 * 10`
- `-2³¹ <= nums[i] <= 2³¹ - 1`
- `nums` 中, 除某个元素仅出现**一次**外, 其余每个元素都恰出现**三次**

:::info 示例
输入: nums = [1, 1, 1, 3]
Expand All @@ -32,7 +32,7 @@ keywords:

## 题解

HashMap 的方式就不说了, 直接看位运算的思路. 因为 -2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1, 可以固定 32 位的二进制. 比如示例:
HashMap 的方式就不说了, 直接看位运算的思路. 因为 `-2³¹ <= nums[i] <= 2³¹ - 1`, 可以固定 32 位的二进制. 比如示例:

- 1: 00000000000000000000000000000001
- 1: 00000000000000000000000000000001
Expand Down
4 changes: 2 additions & 2 deletions leetcode-docs/medium/513-find-bottom-left-value.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -8,8 +8,8 @@ sidebar_label: 513. 找树左下角的值

给定一个二叉树的根节点 `root`, 请找出该二叉树的**最底层最左边**节点的值.

- 二叉树的节点个数的范围是 `[1, 10<sup>4</sup>]`, 即保证二叉树不为空.
- -2<sup>31</sup> <= Node.val <= 2<sup>31</sup> - 1
- 二叉树的节点个数的范围是 `[1, 10]`, 即保证二叉树不为空.
- `-2³¹ <= Node.val <= 2³¹ - 1`

:::info 示例

Expand Down
6 changes: 3 additions & 3 deletions leetcode-docs/medium/515-largest-values.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -10,8 +10,8 @@ keywords:

给定一棵二叉树的根节点 root, 请找出该二叉树中每一层的最大值.

- 二叉树的节点个数的范围是 `[0, 10<sup>4</sup>]`
- -2<sup>31</sup> <= Node.val <= 2<sup>31</sup> - 1
- 二叉树的节点个数的范围是 `[0, 10]`
- `-2³¹ <= Node.val <= 2³¹ - 1`

:::info 示例

Expand All @@ -30,7 +30,7 @@ keywords:

## 题解

没什么难的, 就是层序遍历, 拿到每层最大的值. 注意由于 `node.val` 的范围是 -2<sup>31</sup> <= Node.val <= 2<sup>31</sup> - 1, 所以要把 `max` 的初始值设为 `Number.MIN_SAFE_INTEGER`.
没什么难的, 就是层序遍历, 拿到每层最大的值. 注意由于 `node.val` 的范围是 `-2³¹ <= Node.val <= 2³¹ - 1`, 所以要把 `max` 的初始值设为 `Number.MIN_SAFE_INTEGER`.

```ts
/**
Expand Down
6 changes: 3 additions & 3 deletions leetcode-docs/medium/713-num-subarray-product-less-than-k.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -26,9 +26,9 @@ keywords:

给你一个整数数组 nums 和一个整数 k, 请你返回子数组内所有元素的乘积严格小于 k 的连续子数组的数目.

- 1 <= nums.length <= 3 \* 10<sup>4</sup>
- 1 <= nums[i] <= 1000
- 0 <= k <= 10<sup>6</sup>
- `1 <= nums.length <= 3 * 10`
- `1 <= nums[i] <= 1000`
- `0 <= k <= 10`

:::info 示例

Expand Down
2 changes: 1 addition & 1 deletion leetcode-docs/medium/729-my-calendar.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@ keywords:

当两个日程安排有一些时间上的交叉时(例如两个日程安排都在同一时间内), 就会产生重复预订.

日程可以用一对整数 start 和 end 表示, 这里的时间是半开区间, 即 ` [start, end)``, 实数 x 的范围为 `start <= x < end`.
日程可以用一对整数 start 和 end 表示, 这里的时间是半开区间, 即 `[start, end)`, 实数 x 的范围为 `start <= x < end`.

实现 `MyCalendar` 类:

Expand Down
2 changes: 1 addition & 1 deletion leetcode-docs/medium/873-len-longest-fib-subseq.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -55,7 +55,7 @@ keywords:

当确定了后两个数字下标 `j`, `i`, 需要找到第一个数字下标 `k`, 使得 `k < j`, 且 `arr[k] + arr[j] === arr[i]`. 这样就可以通过 dp[k][j] 递推出 dp[j][i], 具体状态转移方程如下:

- `dp[j][i] = Math.max(dp[k][j] + 1, 3)` // 0 <= k < j, 最短的斐波那契数列是 3, 所以跟 3 比较
- `dp[j][i] = Math.max(dp[k][j] + 1, 3)` // `0 <= k < j`, 最短的斐波那契数列是 3, 所以跟 3 比较
- `dp[j][i] = 0` // 不存在 k, 或者 k >= j

import Tabs from '@theme/Tabs'
Expand Down
2 changes: 1 addition & 1 deletion leetcode-docs/medium/986-interval-intersection.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@ sidebar_label: 986. 区间列表的交集

给定两个由一些**闭区间**组成的列表, `firstList``secondList`, 其中 firstList[i] = [start<sub>i</sub>, end<sub>i</sub>] 而 secondList[j] = [start<sub>j</sub>, end<sub>j</sub>]. 每个区间列表都是成对**不相交**的, 并且已经**排序**. 返回这两个区间列表的交集.

形式上, 闭区间 [a, b] (其中 a <= b) 表示实数 x 的集合, a <= x <= b.
形式上, 闭区间 [a, b] (其中 `a <= b`) 表示实数 x 的集合, 而 `a <= x <= b`.

两个闭区间的交集是一组实数, 要么为空集, 要么为闭区间. 例如, [1, 3][2, 4] 的交集为 [2, 3].

Expand Down
55 changes: 29 additions & 26 deletions package.json
Original file line number Diff line number Diff line change
Expand Up @@ -12,8 +12,8 @@
"build": "docusaurus build",
"swizzle": "docusaurus swizzle",
"deploy": "docusaurus deploy",
"serve": "docusaurus serve",
"clear": "docusaurus clear",
"serve": "docusaurus serve",
"write-translations": "docusaurus write-translations",
"write-heading-ids": "docusaurus write-heading-ids",
"typecheck": "tsc",
Expand All @@ -23,34 +23,25 @@
"statistics": "node packages/lt-cli/bin/lt-cli statistics",
"generator": "node packages/lt-cli/bin/lt-cli create"
},
"browserslist": {
"production": [
">0.5%",
"not dead",
"not op_mini all"
],
"development": [
"last 1 chrome version",
"last 1 firefox version",
"last 1 safari version"
]
},
"dependencies": {
"@docusaurus/core": "^2.4.3",
"@docusaurus/plugin-ideal-image": "^2.4.3",
"@docusaurus/preset-classic": "^2.4.3",
"@docusaurus/theme-live-codeblock": "^2.4.3",
"@mdx-js/react": "^1.6.22",
"clsx": "^1.2.1",
"@docusaurus/core": "^3.0.1",
"@docusaurus/plugin-content-docs": "^3.0.1",
"@docusaurus/plugin-ideal-image": "^3.0.1",
"@docusaurus/preset-classic": "^3.0.1",
"@docusaurus/theme-live-codeblock": "^3.0.1",
"@docusaurus/types": "^3.0.1",
"@mdx-js/react": "^3.0.0",
"clsx": "^2.0.0",
"nuka-carousel": "^4.8.4",
"prism-react-renderer": "^1.3.5",
"react": "^17.0.2",
"react-dom": "^17.0.2",
"prism-react-renderer": "^2.3.0",
"react": "^18.2.0",
"react-dom": "^18.2.0",
"yancey-js-util": "^3.1.0"
},
"devDependencies": {
"@docusaurus/module-type-aliases": "^2.4.3",
"@tsconfig/docusaurus": "^1.0.7",
"@docusaurus/module-type-aliases": "3.0.1",
"@docusaurus/tsconfig": "3.0.1",
"@docusaurus/types": "3.0.1",
"@types/jest": "^29.5.2",
"@typescript-eslint/eslint-plugin": "^5.59.11",
"@typescript-eslint/parser": "^5.59.11",
Expand All @@ -64,7 +55,7 @@
"lint-staged": "^13.2.2",
"prettier": "^2.8.8",
"ts-jest": "^29.1.0",
"typescript": "^5.1.3"
"typescript": "~5.2.2"
},
"lint-staged": {
"*.{ts,js}": [
Expand All @@ -73,7 +64,19 @@
"git add"
]
},
"browserslist": {
"production": [
">0.5%",
"not dead",
"not op_mini all"
],
"development": [
"last 3 chrome version",
"last 3 firefox version",
"last 5 safari version"
]
},
"engines": {
"node": ">=16.14"
"node": ">=18.0"
}
}
Loading

0 comments on commit 9b22407

Please sign in to comment.