Skip to content

Commit 3b0d480

Browse files
committed
deploy docs site c23d725
1 parent 1c989df commit 3b0d480

26 files changed

+65
-65
lines changed

404.html

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,15 +8,15 @@
88
<meta name="generator" content="VitePress v1.2.2">
99
<link rel="preload stylesheet" href="/assets/style.BydYWBLx.css" as="style">
1010

11-
<script type="module" src="/assets/app.DdApryhD.js"></script>
11+
<script type="module" src="/assets/app.Leen0m6X.js"></script>
1212
<link rel="preload" href="/assets/inter-roman-latin.Di8DUHzh.woff2" as="font" type="font/woff2" crossorigin="">
1313
<link rel="icon" href="/images/logo.png">
1414
<script id="check-dark-mode">(()=>{const e=localStorage.getItem("vitepress-theme-appearance")||"auto",a=window.matchMedia("(prefers-color-scheme: dark)").matches;(!e||e==="auto"?a:e==="dark")&&document.documentElement.classList.add("dark")})();</script>
1515
<script id="check-mac-os">document.documentElement.classList.toggle("mac",/Mac|iPhone|iPod|iPad/i.test(navigator.platform));</script>
1616
</head>
1717
<body>
1818
<div id="app"></div>
19-
<script>window.__VP_HASH_MAP__=JSON.parse("{\"data-structure_map.md\":\"Pf3O8Bj1\",\"data-structure_tree.md\":\"Dux-O-gs\",\"data-structure_stack.md\":\"Ddd7koAA\",\"foreword.md\":\"Iv2JYpPx\",\"index.md\":\"D_sRuU8n\",\"data-structure_array.md\":\"CM1KOWt7\",\"data-structure_binarytree.md\":\"DaDz5QaU\",\"data-structure_queue.md\":\"CU01cgDZ\",\"algorithm_idea.md\":\"DdOHpQkI\",\"data-structure_set.md\":\"CN_QG8Ue\",\"data-structure_priorityqueue.md\":\"Bft_rb-c\",\"data-structure_linkedlist.md\":\"DrO7bqR0\",\"algorithm_sort.md\":\"EqYQKfYd\",\"data-structure_doublelinkedlist.md\":\"BDQ4TOkT\",\"data-structure_graph.md\":\"B83jqxTn\",\"data-structure_hashtable.md\":\"BcaMYZMP\",\"algorithm_search.md\":\"BRjMl3vX\",\"data-structure_binarysearchtree.md\":\"B3zICKCO\",\"algorithm_classic.md\":\"CqrOf5Xu\"}");window.__VP_SITE_DATA__=JSON.parse("{\"lang\":\"zh-CN\",\"dir\":\"ltr\",\"title\":\"数据结构与算法\",\"description\":\"JavaScript 数据结构与算法\",\"base\":\"/\",\"head\":[],\"router\":{\"prefetchLinks\":true},\"appearance\":true,\"themeConfig\":{\"logo\":\"/images/logo.png\",\"outline\":{\"level\":[2,4]},\"search\":{\"provider\":\"local\"},\"nav\":[{\"text\":\"前言\",\"link\":\"/foreword\",\"activeMatch\":\"/foreword\"},{\"text\":\"数据结构\",\"link\":\"/data-structure/Array\",\"activeMatch\":\"/data-structure/\"},{\"text\":\"算法\",\"link\":\"/algorithm/sort\",\"activeMatch\":\"/algorithm/\"}],\"sidebar\":{\"/data-structure/\":{\"items\":[{\"text\":\"数组\",\"link\":\"/data-structure/Array\"},{\"text\":\"栈\",\"link\":\"/data-structure/Stack\"},{\"text\":\"队列\",\"link\":\"/data-structure/Queue\"},{\"text\":\"优先队列\",\"link\":\"/data-structure/PriorityQueue\"},{\"text\":\"单向链表\",\"link\":\"/data-structure/LinkedList\"},{\"text\":\"双向链表\",\"link\":\"/data-structure/DoubleLinkedList\"},{\"text\":\"集合\",\"link\":\"/data-structure/Set\"},{\"text\":\"字典\",\"link\":\"/data-structure/Map\"},{\"text\":\"哈希表\",\"link\":\"/data-structure/HashTable\"},{\"text\":\"树\",\"link\":\"/data-structure/Tree\"},{\"text\":\"二叉树\",\"link\":\"/data-structure/BinaryTree\"},{\"text\":\"二叉搜索树\",\"link\":\"/data-structure/BinarySearchTree\"},{\"text\":\"图\",\"link\":\"/data-structure/Graph\"}]},\"/algorithm/\":{\"text\":\"算法\",\"collapsed\":false,\"items\":[{\"text\":\"排序算法\",\"link\":\"/algorithm/sort\"},{\"text\":\"搜索算法\",\"link\":\"/algorithm/search\"},{\"text\":\"算法设计思想\",\"link\":\"/algorithm/idea\"},{\"text\":\"经典算法真题\",\"link\":\"/algorithm/classic\"}]}},\"socialLinks\":[{\"icon\":\"github\",\"link\":\"https://github.com/XPoet/js-data-structure-and-algorithm\"}],\"footer\":{\"message\":\"Released under the AGPL-3.0 License\",\"copyright\":\"Copyright © 2019-present XPoet\"}},\"locales\":{},\"scrollOffset\":134,\"cleanUrls\":false}");</script>
19+
<script>window.__VP_HASH_MAP__=JSON.parse("{\"data-structure_binarytree.md\":\"DaDz5QaU\",\"algorithm_search.md\":\"BRjMl3vX\",\"algorithm_classic.md\":\"CqrOf5Xu\",\"data-structure_binarysearchtree.md\":\"B3zICKCO\",\"data-structure_graph.md\":\"B83jqxTn\",\"algorithm_idea.md\":\"DdOHpQkI\",\"data-structure_hashtable.md\":\"BcaMYZMP\",\"foreword.md\":\"Iv2JYpPx\",\"index.md\":\"D_sRuU8n\",\"data-structure_doublelinkedlist.md\":\"BDQ4TOkT\",\"data-structure_queue.md\":\"CU01cgDZ\",\"data-structure_priorityqueue.md\":\"Bft_rb-c\",\"data-structure_set.md\":\"CN_QG8Ue\",\"data-structure_tree.md\":\"Dux-O-gs\",\"data-structure_stack.md\":\"Ddd7koAA\",\"data-structure_map.md\":\"Pf3O8Bj1\",\"data-structure_array.md\":\"CM1KOWt7\",\"data-structure_linkedlist.md\":\"DrO7bqR0\",\"algorithm_sort.md\":\"EqYQKfYd\"}");window.__VP_SITE_DATA__=JSON.parse("{\"lang\":\"zh-CN\",\"dir\":\"ltr\",\"title\":\"数据结构与算法\",\"description\":\"JavaScript 数据结构与算法\",\"base\":\"/\",\"head\":[],\"router\":{\"prefetchLinks\":true},\"appearance\":true,\"themeConfig\":{\"logo\":\"/images/logo.png\",\"outline\":{\"level\":[2,4]},\"search\":{\"provider\":\"local\"},\"nav\":[{\"text\":\"前言\",\"link\":\"/foreword\",\"activeMatch\":\"/foreword\"},{\"text\":\"数据结构\",\"link\":\"/data-structure/Array\",\"activeMatch\":\"/data-structure/\"},{\"text\":\"算法\",\"link\":\"/algorithm/sort\",\"activeMatch\":\"/algorithm/\"}],\"sidebar\":{\"/data-structure/\":{\"items\":[{\"text\":\"数组\",\"link\":\"/data-structure/Array\"},{\"text\":\"栈\",\"link\":\"/data-structure/Stack\"},{\"text\":\"队列\",\"link\":\"/data-structure/Queue\"},{\"text\":\"优先队列\",\"link\":\"/data-structure/PriorityQueue\"},{\"text\":\"单向链表\",\"link\":\"/data-structure/LinkedList\"},{\"text\":\"双向链表\",\"link\":\"/data-structure/DoubleLinkedList\"},{\"text\":\"集合\",\"link\":\"/data-structure/Set\"},{\"text\":\"字典\",\"link\":\"/data-structure/Map\"},{\"text\":\"哈希表\",\"link\":\"/data-structure/HashTable\"},{\"text\":\"树\",\"link\":\"/data-structure/Tree\"},{\"text\":\"二叉树\",\"link\":\"/data-structure/BinaryTree\"},{\"text\":\"二叉搜索树\",\"link\":\"/data-structure/BinarySearchTree\"},{\"text\":\"图\",\"link\":\"/data-structure/Graph\"}]},\"/algorithm/\":{\"text\":\"算法\",\"collapsed\":false,\"items\":[{\"text\":\"排序算法\",\"link\":\"/algorithm/sort\"},{\"text\":\"搜索算法\",\"link\":\"/algorithm/search\"},{\"text\":\"算法设计思想\",\"link\":\"/algorithm/idea\"},{\"text\":\"经典算法真题\",\"link\":\"/algorithm/classic\"}]}},\"socialLinks\":[{\"icon\":\"github\",\"link\":\"https://github.com/XPoet/js-data-structure-and-algorithm\"}],\"footer\":{\"message\":\"Released under the AGPL-3.0 License\",\"copyright\":\"Copyright © 2019-present XPoet\"}},\"locales\":{},\"scrollOffset\":134,\"cleanUrls\":false}");</script>
2020

2121
</body>
2222
</html>

algorithm/classic.html

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -8,10 +8,10 @@
88
<meta name="generator" content="VitePress v1.2.2">
99
<link rel="preload stylesheet" href="/assets/style.BydYWBLx.css" as="style">
1010

11-
<script type="module" src="/assets/app.DdApryhD.js"></script>
11+
<script type="module" src="/assets/app.Leen0m6X.js"></script>
1212
<link rel="preload" href="/assets/inter-roman-latin.Di8DUHzh.woff2" as="font" type="font/woff2" crossorigin="">
1313
<link rel="modulepreload" href="/assets/chunks/framework.BYhES31N.js">
14-
<link rel="modulepreload" href="/assets/chunks/theme.Gkk0iOub.js">
14+
<link rel="modulepreload" href="/assets/chunks/theme.BXD51d0S.js">
1515
<link rel="modulepreload" href="/assets/algorithm_classic.md.CqrOf5Xu.lean.js">
1616
<link rel="icon" href="/images/logo.png">
1717
<script id="check-dark-mode">(()=>{const e=localStorage.getItem("vitepress-theme-appearance")||"auto",a=window.matchMedia("(prefers-color-scheme: dark)").matches;(!e||e==="auto"?a:e==="dark")&&document.documentElement.classList.add("dark")})();</script>
@@ -340,7 +340,7 @@
340340
<span class="line"><span style="--shiki-light:#D73A49;--shiki-dark:#F97583;">const</span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;"> nums</span><span style="--shiki-light:#D73A49;--shiki-dark:#F97583;"> =</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;"> [</span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">4</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">, </span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">5</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">, </span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">1</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">, </span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">6</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">, </span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">2</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">, </span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">7</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">, </span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">3</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">, </span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;">8</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">]</span></span>
341341
<span class="line"><span style="--shiki-light:#D73A49;--shiki-dark:#F97583;">const</span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;"> k</span><span style="--shiki-light:#D73A49;--shiki-dark:#F97583;"> =</span><span style="--shiki-light:#005CC5;--shiki-dark:#79B8FF;"> 4</span></span>
342342
<span class="line"><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">console.</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;">log</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">(</span><span style="--shiki-light:#6F42C1;--shiki-dark:#B392F0;">findKSmallestNumbersWithMaxHeap</span><span style="--shiki-light:#24292E;--shiki-dark:#E1E4E8;">(nums, k)) </span><span style="--shiki-light:#6A737D;--shiki-dark:#6A737D;">// 输出:[1, 2, 3, 4]</span></span></code></pre><div class="line-numbers-wrapper" aria-hidden="true"><span class="line-number">1</span><br><span class="line-number">2</span><br><span class="line-number">3</span><br><span class="line-number">4</span><br><span class="line-number">5</span><br><span class="line-number">6</span><br><span class="line-number">7</span><br><span class="line-number">8</span><br><span class="line-number">9</span><br><span class="line-number">10</span><br><span class="line-number">11</span><br><span class="line-number">12</span><br><span class="line-number">13</span><br><span class="line-number">14</span><br><span class="line-number">15</span><br></div></div></li></ul></div></div></main><footer class="VPDocFooter" data-v-83890dd9 data-v-b88cabfa><!--[--><!--]--><div class="edit-info" data-v-b88cabfa><!----><div class="last-updated" data-v-b88cabfa><p class="VPLastUpdated" data-v-b88cabfa data-v-9da12f1d>Last updated: <time datetime="2024-05-27T02:48:35.000Z" data-v-9da12f1d></time></p></div></div><nav class="prev-next" aria-labelledby="doc-footer-aria-label" data-v-b88cabfa><span class="visually-hidden" id="doc-footer-aria-label" data-v-b88cabfa>Pager</span><div class="pager" data-v-b88cabfa><a class="VPLink link pager-link prev" href="/algorithm/idea.html" data-v-b88cabfa><!--[--><span class="desc" data-v-b88cabfa>Previous page</span><span class="title" data-v-b88cabfa>算法设计思想</span><!--]--></a></div><div class="pager" data-v-b88cabfa><!----></div></nav></footer><!--[--><!--]--></div></div></div><!--[--><!--]--></div></div><footer class="VPFooter has-sidebar" data-v-a9a9e638 data-v-c970a860><div class="container" data-v-c970a860><p class="message" data-v-c970a860>Released under the AGPL-3.0 License</p><p class="copyright" data-v-c970a860>Copyright © 2019-present XPoet</p></div></footer><!--[--><!--]--></div></div>
343-
<script>window.__VP_HASH_MAP__=JSON.parse("{\"data-structure_map.md\":\"Pf3O8Bj1\",\"data-structure_tree.md\":\"Dux-O-gs\",\"data-structure_stack.md\":\"Ddd7koAA\",\"foreword.md\":\"Iv2JYpPx\",\"index.md\":\"D_sRuU8n\",\"data-structure_array.md\":\"CM1KOWt7\",\"data-structure_binarytree.md\":\"DaDz5QaU\",\"data-structure_queue.md\":\"CU01cgDZ\",\"algorithm_idea.md\":\"DdOHpQkI\",\"data-structure_set.md\":\"CN_QG8Ue\",\"data-structure_priorityqueue.md\":\"Bft_rb-c\",\"data-structure_linkedlist.md\":\"DrO7bqR0\",\"algorithm_sort.md\":\"EqYQKfYd\",\"data-structure_doublelinkedlist.md\":\"BDQ4TOkT\",\"data-structure_graph.md\":\"B83jqxTn\",\"data-structure_hashtable.md\":\"BcaMYZMP\",\"algorithm_search.md\":\"BRjMl3vX\",\"data-structure_binarysearchtree.md\":\"B3zICKCO\",\"algorithm_classic.md\":\"CqrOf5Xu\"}");window.__VP_SITE_DATA__=JSON.parse("{\"lang\":\"zh-CN\",\"dir\":\"ltr\",\"title\":\"数据结构与算法\",\"description\":\"JavaScript 数据结构与算法\",\"base\":\"/\",\"head\":[],\"router\":{\"prefetchLinks\":true},\"appearance\":true,\"themeConfig\":{\"logo\":\"/images/logo.png\",\"outline\":{\"level\":[2,4]},\"search\":{\"provider\":\"local\"},\"nav\":[{\"text\":\"前言\",\"link\":\"/foreword\",\"activeMatch\":\"/foreword\"},{\"text\":\"数据结构\",\"link\":\"/data-structure/Array\",\"activeMatch\":\"/data-structure/\"},{\"text\":\"算法\",\"link\":\"/algorithm/sort\",\"activeMatch\":\"/algorithm/\"}],\"sidebar\":{\"/data-structure/\":{\"items\":[{\"text\":\"数组\",\"link\":\"/data-structure/Array\"},{\"text\":\"栈\",\"link\":\"/data-structure/Stack\"},{\"text\":\"队列\",\"link\":\"/data-structure/Queue\"},{\"text\":\"优先队列\",\"link\":\"/data-structure/PriorityQueue\"},{\"text\":\"单向链表\",\"link\":\"/data-structure/LinkedList\"},{\"text\":\"双向链表\",\"link\":\"/data-structure/DoubleLinkedList\"},{\"text\":\"集合\",\"link\":\"/data-structure/Set\"},{\"text\":\"字典\",\"link\":\"/data-structure/Map\"},{\"text\":\"哈希表\",\"link\":\"/data-structure/HashTable\"},{\"text\":\"树\",\"link\":\"/data-structure/Tree\"},{\"text\":\"二叉树\",\"link\":\"/data-structure/BinaryTree\"},{\"text\":\"二叉搜索树\",\"link\":\"/data-structure/BinarySearchTree\"},{\"text\":\"图\",\"link\":\"/data-structure/Graph\"}]},\"/algorithm/\":{\"text\":\"算法\",\"collapsed\":false,\"items\":[{\"text\":\"排序算法\",\"link\":\"/algorithm/sort\"},{\"text\":\"搜索算法\",\"link\":\"/algorithm/search\"},{\"text\":\"算法设计思想\",\"link\":\"/algorithm/idea\"},{\"text\":\"经典算法真题\",\"link\":\"/algorithm/classic\"}]}},\"socialLinks\":[{\"icon\":\"github\",\"link\":\"https://github.com/XPoet/js-data-structure-and-algorithm\"}],\"footer\":{\"message\":\"Released under the AGPL-3.0 License\",\"copyright\":\"Copyright © 2019-present XPoet\"}},\"locales\":{},\"scrollOffset\":134,\"cleanUrls\":false}");</script>
343+
<script>window.__VP_HASH_MAP__=JSON.parse("{\"data-structure_binarytree.md\":\"DaDz5QaU\",\"algorithm_search.md\":\"BRjMl3vX\",\"algorithm_classic.md\":\"CqrOf5Xu\",\"data-structure_binarysearchtree.md\":\"B3zICKCO\",\"data-structure_graph.md\":\"B83jqxTn\",\"algorithm_idea.md\":\"DdOHpQkI\",\"data-structure_hashtable.md\":\"BcaMYZMP\",\"foreword.md\":\"Iv2JYpPx\",\"index.md\":\"D_sRuU8n\",\"data-structure_doublelinkedlist.md\":\"BDQ4TOkT\",\"data-structure_queue.md\":\"CU01cgDZ\",\"data-structure_priorityqueue.md\":\"Bft_rb-c\",\"data-structure_set.md\":\"CN_QG8Ue\",\"data-structure_tree.md\":\"Dux-O-gs\",\"data-structure_stack.md\":\"Ddd7koAA\",\"data-structure_map.md\":\"Pf3O8Bj1\",\"data-structure_array.md\":\"CM1KOWt7\",\"data-structure_linkedlist.md\":\"DrO7bqR0\",\"algorithm_sort.md\":\"EqYQKfYd\"}");window.__VP_SITE_DATA__=JSON.parse("{\"lang\":\"zh-CN\",\"dir\":\"ltr\",\"title\":\"数据结构与算法\",\"description\":\"JavaScript 数据结构与算法\",\"base\":\"/\",\"head\":[],\"router\":{\"prefetchLinks\":true},\"appearance\":true,\"themeConfig\":{\"logo\":\"/images/logo.png\",\"outline\":{\"level\":[2,4]},\"search\":{\"provider\":\"local\"},\"nav\":[{\"text\":\"前言\",\"link\":\"/foreword\",\"activeMatch\":\"/foreword\"},{\"text\":\"数据结构\",\"link\":\"/data-structure/Array\",\"activeMatch\":\"/data-structure/\"},{\"text\":\"算法\",\"link\":\"/algorithm/sort\",\"activeMatch\":\"/algorithm/\"}],\"sidebar\":{\"/data-structure/\":{\"items\":[{\"text\":\"数组\",\"link\":\"/data-structure/Array\"},{\"text\":\"栈\",\"link\":\"/data-structure/Stack\"},{\"text\":\"队列\",\"link\":\"/data-structure/Queue\"},{\"text\":\"优先队列\",\"link\":\"/data-structure/PriorityQueue\"},{\"text\":\"单向链表\",\"link\":\"/data-structure/LinkedList\"},{\"text\":\"双向链表\",\"link\":\"/data-structure/DoubleLinkedList\"},{\"text\":\"集合\",\"link\":\"/data-structure/Set\"},{\"text\":\"字典\",\"link\":\"/data-structure/Map\"},{\"text\":\"哈希表\",\"link\":\"/data-structure/HashTable\"},{\"text\":\"树\",\"link\":\"/data-structure/Tree\"},{\"text\":\"二叉树\",\"link\":\"/data-structure/BinaryTree\"},{\"text\":\"二叉搜索树\",\"link\":\"/data-structure/BinarySearchTree\"},{\"text\":\"图\",\"link\":\"/data-structure/Graph\"}]},\"/algorithm/\":{\"text\":\"算法\",\"collapsed\":false,\"items\":[{\"text\":\"排序算法\",\"link\":\"/algorithm/sort\"},{\"text\":\"搜索算法\",\"link\":\"/algorithm/search\"},{\"text\":\"算法设计思想\",\"link\":\"/algorithm/idea\"},{\"text\":\"经典算法真题\",\"link\":\"/algorithm/classic\"}]}},\"socialLinks\":[{\"icon\":\"github\",\"link\":\"https://github.com/XPoet/js-data-structure-and-algorithm\"}],\"footer\":{\"message\":\"Released under the AGPL-3.0 License\",\"copyright\":\"Copyright © 2019-present XPoet\"}},\"locales\":{},\"scrollOffset\":134,\"cleanUrls\":false}");</script>
344344

345345
</body>
346346
</html>

0 commit comments

Comments
 (0)