FE-Algorithm/.dumirc.ts at master · wadeewang/FE-Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
import { defineConfig } from 'dumi';
const repo = 'FE-Algorithm'; // 项目名
export default defineConfig({
  favicons: [
    '/favicon.ico',
  ],
  base: process.env.NODE_ENV === 'production' ? `/${repo}/` : '/',
  publicPath: process.env.NODE_ENV === 'production' ? `/${repo}/` : '/',
  themeConfig: {
    name: 'Ustinian',
    // title: 'algorithm',
    logo: '/logo.png',
    nav: [
      { title: '每日一题', link: '/dailyquestion/two-sum' },
      { title: '算法',link: '/algorithm/stack/reversePolish',},
      { title: '挑战', link: '/challenge' },
      { title: '数据结构', link: '/datastr/structure' },
      { title: 'React中的算法', link: '/react/bitfield' },
      {
        title: 'Github',
        link: 'https://github.com/W-HanYu/FE-Algorithm',
      },
    ],
    sidebar: {
      '/algorithm/dynamic/': [
        {
          title:'数组',
          children:[

          ]
        },
        {
          title: '链表相关',
          children: [
            {
              link: '/algorithm/chainList/reversePolish',
              title: '01.奇偶链表',
              order: 1,
              frontmatter: { title: '' },
            },
            {
              link: '/algorithm/chainList/stockTiming',
              title: '02.删除链表重复元素II',
              order: 2,
              frontmatter: { title: '' },
            },
            {
              link: '/algorithm/chainList/decoding',
              title: '03.删除链表重复元素',
              order: 3,
              frontmatter: { title: '' },
            },
          ],
        },
        {
          title:'哈希表',
          children:[]
        },
        {
          title:'字符串',
          children:[]
        },
        {
          title:'双指针',
          children:[]
        },
        {
          title: '栈与队列',
          children: [
            {
              link: '/algorithm/stack/reversePolish',
              title: '01.逆波兰表达式求值',
              order: 1,
              frontmatter: { title: '' },
            },
            {
              link: '/algorithm/stack/topKFrequentElements',
              title: '02.前K个高频元素',
              order: 2,
              frontmatter: { title: '' },
            },
            {
              link: '/algorithm/stack/decoding',
              title: '03.删除相邻重复项',
              order: 3,
              frontmatter: { title: '' },
            },
          ],
        },
        {
          title:'二叉树',
          children:[]
        },
        {
          title:'回溯算法',
          children:[]
        },
        {
          title:'贪心算法',
          children:[]
        },
        {
          title: '动态规划',
          children: [
            {
              link: '/algorithm/dynamic/subsequence',
              title: '01.不同的子序列',
              order: 1,
              frontmatter: { title: '' },
            },
            {
              link: '/algorithm/dynamic/stockTiming',
              title: '02.买卖股票的最佳时机 III',
              order: 2,
              frontmatter: { title: '' },
            },
            {
              link: '/algorithm/dynamic/decoding',
              title: '03.解码问题',
              order: 3,
              frontmatter: { title: '' },
            },
          ],
        },
      ],

    },
    prefersColor: { default: 'dark', switch: true },
    footer: `Ustinian MIT Licensed | Copyright © 2023-present
<br />
Powered by Ustinian`,
  },
});