IMAP(Internet Mail Access Protocol)以前称作交互邮件访问协议(Interactive Mail Access Protocol),是一个应用层协议。IMAP是斯坦福大学在1986年开发的一种邮件获取协议。它的主要作用是邮件客户端可以通过这种协议从邮件服务器上获取邮件的信息,下载邮件等。当前的权威定义是RFC3501。IMAP协议运行在TCP/IP协议之上,使用的端口是143。它与POP3协议的主要区别是用户可以不用把所有的邮件全部下载,可以通过客户端直接对服务器上的邮件进行操作,提供了SSL加密的IMAP协议被称为IMAP S,POP3 默认端口143,POP3S默认端口993。
class Solution {
+ public int timeRequiredToBuy(int[] tickets, int k) {
+ int ret = 0;
+ for (int i = 0; i < tickets.length; i++) {
+ if (i <= k) {
+ ret = ret + Math.min(tickets[i], tickets[k]);
+ } else {
+ ret = ret + Math.min(tickets[i], tickets[k] - 1);
+ }
+ }
+ return ret;
+ }
+}
+
W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=android, name=id, value=0x100b0001
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=, name=layout, value=0x10030009
+W: Could not decode attr value, using undecoded value instead: ns=, name=style, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=android, name=textAppearance, value=0x100d0058
+W: Could not decode attr value, using undecoded value instead: ns=, name=style, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=android, name=textAppearance, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=android, name=height, value=0x100a0003
+W: Could not decode attr value, using undecoded value instead: ns=android, name=width, value=0x100a0003
+I: Decoding values */* XMLs...
+Can't find framework resources for package of id: 16. You must install proper framework files, see project website for more info.
+
C:\Users\dyt\Desktop\dex-tools-2.1-SNAPSHOT>d2j-dex2jar.bat classes.dex
+dex2jar classes.dex -> .\classes-dex2jar.jar
+Detail Error Information in File .\classes-error.zip
+Please report this file to one of following link if possible (any one).
+ https://sourceforge.net/p/dex2jar/tickets/
+ https://bitbucket.org/pxb1988/dex2jar/issues
+ https://github.com/pxb1988/dex2jar/issues [no attachment support, not preferred]
+ dex2jar@googlegroups.com
+
数据通信的任务是传输( D )代码的比特序列。 A. 十进制 B. 帧结构 C. 分组结构 D. 二进制
( B )信号的电平是连续变化的。 A. 数字 B. 模拟 C. 脉冲 D. 二进制
( C)是指将数字信号转变成可以在电话线上传输的模拟信号的过程。 A. 解调 B. 采样 C. 调制 D. 压缩
数据传输速率是指每秒钟传输构成数据二进制代码的(D )数。 A. 码元 B. 信元 C. 波特 D. 位
利用模拟通信信道传输数据信号的方法称为( A )。 A. 频带传输 B. 基带传输 C. 异步传输 D. 同步传输
基带传输是指在数字通信信道上( C )传输数字数据信号的方法。 A. 调制 B. 脉冲编码 C. 直接 D. 间接
数据在通信信道传输的过程中,对数据传输的误码率影响最主要的因素是( D )。 A. 传输速率 B. 调制解调器 C. 传输介质 D. 噪声强度 9.Internet上的数据交换采用的是( A )。 A. 分组交换 B. 电路交换 C. 报文交换 D. 光交换
FDM是指( A )。 A. 频分多路复用 B. 时分多路复用 C. 波分多路复用 D. 码分多路利用
利用( A ),数字数据可以用模拟信号来表示。 A. 调制解调器 B. 编码解码器 C. 串联放大器 D. 电话网络
在数据通信系统中,传输介质的功能是( D )。 A. 在信源与信宿之间传输信息 B.纠正传输过程中的错误 C. 根据环境状况自动调整信号形式 D. 将信号从一端传至另一端
在光纤中采用的多路复用技术是( C )。 A. 时分多路复用 B. 频分多路复用 C. 波分多路复用 D. 码分多路复用
为了实现长距离传输,模拟传输系统都使用放大器来使信号中的能量得到增加,其噪声分量( A )。 A. 增大 B. 减小 C. 不变 D. 不一定
“复用”是一种将若干个彼此独立的信号合并为一个可在同一信道上传输的( C )。 A. 调制信号 B. 已调信号 C. 复用信号 D. 单边带信号
物理层4个重要特性:机械特性、功能特性、电气特性和(A)。 A. 规程特性 B. 接口特性 C.协议特性 D. 物理特性 17. 基带系统使用(C)进行传输的。 A. 模拟信号 B. 调制信号 C. 数字信号 D. 载波信号 18. 下列关于异步传输说法正确的是(D)。 A. 一次传输一个数据块 B. 对时序的要求较高 C. 收/发端不需要进行同步 D. 数据传输速率低 19. 低通通道带宽为5KHz,编码采用512级分级信号,最大数据传输率(D)。 A. 32 kbps B. 48 kbps C. 64 kbps D. 90 kbps
`,59),p=[r];function l(i,d){return e(),a("div",null,p)}const c=t(n,[["render",l],["__file","15d9e331.html.vue"]]);export{c as default};
diff --git a/assets/15d9e331.html-a77e6597.js b/assets/15d9e331.html-a77e6597.js
new file mode 100644
index 0000000..9586b14
--- /dev/null
+++ b/assets/15d9e331.html-a77e6597.js
@@ -0,0 +1 @@
+const e=JSON.parse(`{"key":"v-0a4f90b1","path":"/8612fa7f/ec060e02/Hadoop/15d9e331.html","title":"win10下hadoop学习","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/ec060e02/Hadoop/15d9e331.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/ec060e02/Hadoop/15d9e331.html\\",\\"headline\\":\\"win10下hadoop学习\\",\\"name\\":\\"win10下hadoop学习\\",\\"datePublished\\":\\"2021-04-23\\",\\"dateModified\\":\\"2021-04-23\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/ec060e02/Hadoop/15d9e331.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"hadoop\\",\\"win10下hadoop学习\\"]}"]],"title":"win10下hadoop学习","tags":[{"name":"hadoop","path":"/tags/hadoop"}],"categories":[{"name":"大数据","path":"/categories/ec060e02"}],"keywords":["hadoop","win10下hadoop学习"],"date":"2021-04-23T21:55:57.000Z","abbrlink":"15d9e331","permalink":"/8612fa7f/ec060e02/Hadoop/15d9e331.html"},"headers":[{"level":1,"title":"下载","slug":"下载","link":"#下载","children":[]},{"level":1,"title":"配置环境变量","slug":"配置环境变量","link":"#配置环境变量","children":[]},{"level":1,"title":"配置文件","slug":"配置文件","link":"#配置文件","children":[]},{"level":1,"title":"缺失文件","slug":"缺失文件","link":"#缺失文件","children":[]},{"level":1,"title":"遇到的问题","slug":"遇到的问题","link":"#遇到的问题","children":[{"level":2,"title":"节点未格式化","slug":"节点未格式化","link":"#节点未格式化","children":[]}]},{"level":1,"title":"启动","slug":"启动","link":"#启动","children":[{"level":2,"title":"访问8088","slug":"访问8088","link":"#访问8088","children":[]},{"level":2,"title":"访问9000","slug":"访问9000","link":"#访问9000","children":[]},{"level":2,"title":"访问9870(hadoop新版本默认)","slug":"访问9870-hadoop新版本默认","link":"#访问9870-hadoop新版本默认","children":[]}]},{"level":1,"title":"关闭","slug":"关闭","link":"#关闭","children":[]},{"level":1,"title":"开发时修改权限","slug":"开发时修改权限","link":"#开发时修改权限","children":[]},{"level":1,"title":"测试","slug":"测试","link":"#测试","children":[{"level":2,"title":"环境准备","slug":"环境准备","link":"#环境准备","children":[]},{"level":2,"title":"代码编写","slug":"代码编写","link":"#代码编写","children":[]},{"level":2,"title":"运行结果","slug":"运行结果","link":"#运行结果","children":[]}]},{"level":1,"title":"结语","slug":"结语","link":"#结语","children":[]}]}`);export{e as data};
diff --git a/assets/2157fe1d.html-06c71e1d.js b/assets/2157fe1d.html-06c71e1d.js
new file mode 100644
index 0000000..86b4fd1
--- /dev/null
+++ b/assets/2157fe1d.html-06c71e1d.js
@@ -0,0 +1 @@
+import{_ as r,r as i,o as h,c as d,d as l,w as n,e as a,a as t}from"./app-5c46a61a.js";const o={},c=a('
',87);function u(p,f){const e=i("center");return h(),d("div",null,[c,l(e,null,{default:n(()=>[b]),_:1}),s])}const _=r(o,[["render",u],["__file","2157fe1d.html.vue"]]);export{_ as default};
diff --git a/assets/2157fe1d.html-9fef4a27.js b/assets/2157fe1d.html-9fef4a27.js
new file mode 100644
index 0000000..604b185
--- /dev/null
+++ b/assets/2157fe1d.html-9fef4a27.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-174701eb","path":"/8612fa7f/7c36b624/d3ee0f4f/2157fe1d.html","title":"信息检索-绪论","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/7c36b624/d3ee0f4f/2157fe1d.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/7c36b624/d3ee0f4f/2157fe1d.html\\",\\"headline\\":\\"信息检索-绪论\\",\\"name\\":\\"信息检索-绪论\\",\\"datePublished\\":\\"2020-05-06\\",\\"dateModified\\":\\"2020-05-06\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/7c36b624/d3ee0f4f/2157fe1d.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"信息检索\\",\\"dyt\\",\\"dragondyt\\",\\"论文写作\\",\\"信息\\",\\"知识\\",\\"文献\\",\\"目录\\",\\"索引\\",\\"文摘\\",\\"检索途径\\"]}"]],"title":"信息检索-绪论","tags":[{"name":"信息检索","path":"/tags/d3ee0f4f"}],"categories":[{"name":"信息检索","path":"/categories/d3ee0f4f"}],"keywords":["信息检索","dyt","dragondyt","论文写作","信息","知识","文献","目录","索引","文摘","检索途径"],"date":"2020-05-06T21:55:57.000Z","abbrlink":"2157fe1d","permalink":"/8612fa7f/7c36b624/d3ee0f4f/2157fe1d.html"},"headers":[{"level":2,"title":"信息与文献基本知识","slug":"信息与文献基本知识","link":"#信息与文献基本知识","children":[]},{"level":2,"title":"信息检索基础","slug":"信息检索基础","link":"#信息检索基础","children":[]},{"level":2,"title":"信息检索的途径","slug":"信息检索的途径","link":"#信息检索的途径","children":[]},{"level":2,"title":"信息检索的步骤和方法","slug":"信息检索的步骤和方法","link":"#信息检索的步骤和方法","children":[]},{"level":2,"title":"计算机信息检索基础","slug":"计算机信息检索基础","link":"#计算机信息检索基础","children":[]},{"level":2,"title":"思考题:","slug":"思考题","link":"#思考题","children":[]},{"level":2,"title":"操作题:","slug":"操作题","link":"#操作题","children":[]}]}`);export{t as data};
diff --git a/assets/29596f0c.html-20bdad68.js b/assets/29596f0c.html-20bdad68.js
new file mode 100644
index 0000000..a8abce7
--- /dev/null
+++ b/assets/29596f0c.html-20bdad68.js
@@ -0,0 +1,13 @@
+import{_ as e,o as a,c,e as r}from"./app-5c46a61a.js";const s={},n=r(`
`,28),t=[n];function o(l,i){return a(),c("div",null,t)}const d=e(s,[["render",o],["__file","29596f0c.html.vue"]]);export{d as default};
diff --git a/assets/29596f0c.html-a7ddfb8b.js b/assets/29596f0c.html-a7ddfb8b.js
new file mode 100644
index 0000000..4ccd930
--- /dev/null
+++ b/assets/29596f0c.html-a7ddfb8b.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-b46656c2","path":"/8612fa7f/8f8103b7/Docker/29596f0c.html","title":"在docker安装elasticsearch","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/8f8103b7/Docker/29596f0c.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/8f8103b7/Docker/29596f0c.html\\",\\"headline\\":\\"在docker安装elasticsearch\\",\\"name\\":\\"在docker安装elasticsearch\\",\\"datePublished\\":\\"2020-04-29\\",\\"dateModified\\":\\"2020-04-29\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/8f8103b7/Docker/29596f0c.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"java\\",\\"dyt\\",\\"dragondyt\\",\\"elasticsearch\\",\\"docker\\"]}"]],"title":"在docker安装elasticsearch","tags":[{"name":"docker","path":"/tags/docker"}],"categories":[{"name":"教程","path":"/categories/1868f51e"}],"keywords":["java","dyt","dragondyt","elasticsearch","docker"],"date":"2020-04-29T21:55:57.000Z","abbrlink":"29596f0c","permalink":"/8612fa7f/8f8103b7/Docker/29596f0c.html"},"headers":[{"level":2,"title":"安装elasticsearch(简称es)","slug":"安装elasticsearch-简称es","link":"#安装elasticsearch-简称es","children":[]},{"level":2,"title":"安装可视化控件(kibana,elasticsearch-head…)","slug":"安装可视化控件-kibana-elasticsearch-head","link":"#安装可视化控件-kibana-elasticsearch-head","children":[]}]}`);export{t as data};
diff --git a/assets/2a1f0504.html-11f2c670.js b/assets/2a1f0504.html-11f2c670.js
new file mode 100644
index 0000000..fb4ff4e
--- /dev/null
+++ b/assets/2a1f0504.html-11f2c670.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-4339b5be","path":"/8612fa7f/b7e144d1/2362a8ea/2a1f0504.html","title":"[21]合并两个有序链表","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"链表\\",\\"item\\":\\"https://blog.dragondyt.top/categories/2362a8ea\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/2a1f0504.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/2a1f0504.html\\",\\"headline\\":\\"[21]合并两个有序链表\\",\\"name\\":\\"[21]合并两个有序链表\\",\\"datePublished\\":\\"2022-07-28\\",\\"dateModified\\":\\"2022-07-28\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/2a1f0504.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[21]合并两个有序链表","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"链表","path":"/categories/2362a8ea"}],"tags":[{"name":"链表","path":"/tags/2362a8ea"}],"date":"2022-07-28 15:58:04","abbrlink":"2a1f0504","permalink":"/8612fa7f/b7e144d1/2362a8ea/2a1f0504.html"},"headers":[]}`);export{t as data};
diff --git a/assets/2a1f0504.html-5c7ea01b.js b/assets/2a1f0504.html-5c7ea01b.js
new file mode 100644
index 0000000..256a0ca
--- /dev/null
+++ b/assets/2a1f0504.html-5c7ea01b.js
@@ -0,0 +1,32 @@
+import{_ as e,o as t,c as p,a as n}from"./app-5c46a61a.js";const l={},s=n("pre",null,[n("code",{class:"language-java"},`class Solution {
+ public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
+ // 虚拟头结点
+ ListNode dummy = new ListNode(-1), p = dummy;
+ ListNode p1 = l1, p2 = l2;
+
+ while (p1 != null && p2 != null) {
+ // 比较 p1 和 p2 两个指针
+ // 将值较小的的节点接到 p 指针
+ if (p1.val > p2.val) {
+ p.next = p2;
+ p2 = p2.next;
+ } else {
+ p.next = p1;
+ p1 = p1.next;
+ }
+ // p 指针不断前进
+ p = p.next;
+ }
+
+ if (p1 != null) {
+ p.next = p1;
+ }
+
+ if (p2 != null) {
+ p.next = p2;
+ }
+
+ return dummy.next;
+ }
+}
+`)],-1),o=[s];function a(i,c){return t(),p("div",null,o)}const u=e(l,[["render",a],["__file","2a1f0504.html.vue"]]);export{u as default};
diff --git a/assets/2cf49dc6.html-049b4a75.js b/assets/2cf49dc6.html-049b4a75.js
new file mode 100644
index 0000000..1d1efc7
--- /dev/null
+++ b/assets/2cf49dc6.html-049b4a75.js
@@ -0,0 +1,29 @@
+import{_ as e,o as t,c as s,a as n}from"./app-5c46a61a.js";const o={},l=n("pre",null,[n("code",{class:"language-java"},`class Solution {
+ public ListNode mergeKLists(ListNode[] lists) {
+ if (lists.length == 0) return null;
+ // 虚拟头结点
+ ListNode dummy = new ListNode(-1);
+ ListNode p = dummy;
+ // 优先级队列,最小堆
+ PriorityQueue pq = new PriorityQueue<>(
+ lists.length, (a, b)->(a.val - b.val));
+ // 将 k 个链表的头结点加入最小堆
+ for (ListNode head : lists) {
+ if (head != null)
+ pq.add(head);
+ }
+
+ while (!pq.isEmpty()) {
+ // 获取最小节点,接到结果链表中
+ ListNode node = pq.poll();
+ p.next = node;
+ if (node.next != null) {
+ pq.add(node.next);
+ }
+ // p 指针不断前进
+ p = p.next;
+ }
+ return dummy.next;
+ }
+}
+`)],-1),d=n("p",null,"总结:优先级队列",-1),i=[l,d];function a(c,r){return t(),s("div",null,i)}const p=e(o,[["render",a],["__file","2cf49dc6.html.vue"]]);export{p as default};
diff --git a/assets/2cf49dc6.html-4bb1a3d6.js b/assets/2cf49dc6.html-4bb1a3d6.js
new file mode 100644
index 0000000..01516fd
--- /dev/null
+++ b/assets/2cf49dc6.html-4bb1a3d6.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-3e64061e","path":"/8612fa7f/b7e144d1/2362a8ea/2cf49dc6.html","title":"[23]合并K个升序链表","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"链表\\",\\"item\\":\\"https://blog.dragondyt.top/categories/2362a8ea\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/2cf49dc6.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/2cf49dc6.html\\",\\"headline\\":\\"[23]合并K个升序链表\\",\\"name\\":\\"[23]合并K个升序链表\\",\\"datePublished\\":\\"2022-07-28\\",\\"dateModified\\":\\"2022-07-28\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/2cf49dc6.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[23]合并K个升序链表","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"链表","path":"/categories/2362a8ea"}],"tags":[{"name":"链表","path":"/tags/2362a8ea"}],"date":"2022-07-28 16:10:15","abbrlink":"2cf49dc6","permalink":"/8612fa7f/b7e144d1/2362a8ea/2cf49dc6.html"},"headers":[]}`);export{t as data};
diff --git a/assets/36462e02.html-2409ae54.js b/assets/36462e02.html-2409ae54.js
new file mode 100644
index 0000000..c3845ba
--- /dev/null
+++ b/assets/36462e02.html-2409ae54.js
@@ -0,0 +1,34 @@
+import{_ as e,o as t,c as s,a as n}from"./app-5c46a61a.js";const i={},a=n("pre",null,[n("code",{class:"language-java"},`/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode() {}
+ * ListNode(int val) { this.val = val; }
+ * ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+ public ListNode removeNthFromEnd(ListNode head, int n) {
+ //删除倒数第N个,那我怎么知道N的位置,链表长度不是固定的
+ //假设是1到x,那么第倒数第N个应该是 X - N + 1
+ //Y = X - N + 1 ,则
+ // 虚拟头结点
+ ListNode pre = new ListNode(0);
+ pre.next = head;
+ ListNode start = pre, end = pre;
+ // p1 先走 n 步
+ while (n != 0) {
+ start = start.next;
+ n--;
+ }
+ // p1 和 p2 同时走 x - n 步,当p1走完时,p2走了 x-n步,停在X - N + 1上
+ while (start.next != null) {
+ start = start.next;
+ end = end.next;
+ }
+ end.next = end.next.next;
+ return pre.next;
+ }
+}
+`)],-1),o=[a];function l(r,d){return t(),s("div",null,o)}const x=e(i,[["render",l],["__file","36462e02.html.vue"]]);export{x as default};
diff --git a/assets/36462e02.html-8063d2f3.js b/assets/36462e02.html-8063d2f3.js
new file mode 100644
index 0000000..c8b95aa
--- /dev/null
+++ b/assets/36462e02.html-8063d2f3.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-124fddb4","path":"/8612fa7f/b7e144d1/2362a8ea/36462e02.html","title":"[19]删除链表的倒数第 N 个结点","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"链表\\",\\"item\\":\\"https://blog.dragondyt.top/categories/2362a8ea\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/36462e02.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/36462e02.html\\",\\"headline\\":\\"[19]删除链表的倒数第 N 个结点\\",\\"name\\":\\"[19]删除链表的倒数第 N 个结点\\",\\"datePublished\\":\\"2022-08-03\\",\\"dateModified\\":\\"2022-08-03\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/36462e02.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[19]删除链表的倒数第 N 个结点","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"链表","path":"/categories/2362a8ea"}],"tags":[{"name":"链表","path":"/tags/2362a8ea"}],"date":"2022-08-03 15:19:58","abbrlink":"36462e02","permalink":"/8612fa7f/b7e144d1/2362a8ea/36462e02.html"},"headers":[]}`);export{t as data};
diff --git a/assets/3758805c.html-6c4a5950.js b/assets/3758805c.html-6c4a5950.js
new file mode 100644
index 0000000..f0e700c
--- /dev/null
+++ b/assets/3758805c.html-6c4a5950.js
@@ -0,0 +1,31 @@
+import{_ as e,o as t,c as o,a as n}from"./app-5c46a61a.js";const p={},s=n("pre",null,[n("code",{class:"language-java"},`class Solution {
+ public ListNode partition(ListNode head, int x) {
+ // 存放小于 x 的链表的虚拟头结点
+ ListNode dummy1 = new ListNode(-1);
+ // 存放大于等于 x 的链表的虚拟头结点
+ ListNode dummy2 = new ListNode(-1);
+ // p1, p2 指针负责生成结果链表
+ ListNode p1 = dummy1, p2 = dummy2;
+ // p 负责遍历原链表,类似合并两个有序链表的逻辑
+ // 这里是将一个链表分解成两个链表
+ ListNode p = head;
+ while (p != null) {
+ if (p.val >= x) {
+ p2.next = p;
+ p2 = p2.next;
+ } else {
+ p1.next = p;
+ p1 = p1.next;
+ }
+ // 断开原链表中的每个节点的 next 指针
+ ListNode temp = p.next;
+ p.next = null;
+ p = temp;
+ }
+ // 连接两个链表
+ p1.next = dummy2.next;
+
+ return dummy1.next;
+ }
+}
+`)],-1),d=[s];function i(l,a){return t(),o("div",null,d)}const m=e(p,[["render",i],["__file","3758805c.html.vue"]]);export{m as default};
diff --git a/assets/3758805c.html-b9824761.js b/assets/3758805c.html-b9824761.js
new file mode 100644
index 0000000..00d878a
--- /dev/null
+++ b/assets/3758805c.html-b9824761.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-28dbf2be","path":"/8612fa7f/b7e144d1/2362a8ea/3758805c.html","title":"[86]分隔链表","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"链表\\",\\"item\\":\\"https://blog.dragondyt.top/categories/2362a8ea\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/3758805c.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/3758805c.html\\",\\"headline\\":\\"[86]分隔链表\\",\\"name\\":\\"[86]分隔链表\\",\\"datePublished\\":\\"2022-07-28\\",\\"dateModified\\":\\"2022-07-28\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/3758805c.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[86]分隔链表","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"链表","path":"/categories/2362a8ea"}],"tags":[{"name":"链表","path":"/tags/2362a8ea"}],"date":"2022-07-28 15:58:04","abbrlink":"3758805c","permalink":"/8612fa7f/b7e144d1/2362a8ea/3758805c.html"},"headers":[]}`);export{t as data};
diff --git a/assets/389d18c2.html-952307de.js b/assets/389d18c2.html-952307de.js
new file mode 100644
index 0000000..4cc9bf9
--- /dev/null
+++ b/assets/389d18c2.html-952307de.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-bb3d14f0","path":"/8612fa7f/b7e144d1/2362a8ea/389d18c2.html","title":"[160]相交链表","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"链表\\",\\"item\\":\\"https://blog.dragondyt.top/categories/2362a8ea\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/389d18c2.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/389d18c2.html\\",\\"headline\\":\\"[160]相交链表\\",\\"name\\":\\"[160]相交链表\\",\\"datePublished\\":\\"2022-08-04\\",\\"dateModified\\":\\"2022-08-04\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/389d18c2.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[160]相交链表","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"链表","path":"/categories/2362a8ea"}],"tags":[{"name":"链表","path":"/tags/2362a8ea"},{"name":"双指针","path":"/tags/91a7e4d1"}],"date":"2022-08-04 10:20:55","abbrlink":"389d18c2","permalink":"/8612fa7f/b7e144d1/2362a8ea/389d18c2.html"},"headers":[]}`);export{t as data};
diff --git a/assets/389d18c2.html-ff81f812.js b/assets/389d18c2.html-ff81f812.js
new file mode 100644
index 0000000..e2de23b
--- /dev/null
+++ b/assets/389d18c2.html-ff81f812.js
@@ -0,0 +1,22 @@
+import{_ as n,o as t,c as s,a as e}from"./app-5c46a61a.js";const o={},a=e("pre",null,[e("code",{class:"language-java"},`public class Solution {
+ public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
+ // p1 指向 A 链表头结点,p2 指向 B 链表头结点
+ ListNode p1 = headA, p2 = headB;
+ while (p1 != p2) {
+ // p1 走一步,如果走到 A 链表末尾,转到 B 链表
+ if (p1 == null) {
+ p1 = headB;
+ } else {
+ p1 = p1.next;
+ }
+ // p2 走一步,如果走到 B 链表末尾,转到 A 链表
+ if (p2 == null) {
+ p2 = headA;
+ } else {
+ p2 = p2.next;
+ }
+ }
+ return p1;
+ }
+}
+`)],-1),c=[a];function l(p,d){return t(),s("div",null,c)}const _=n(o,[["render",l],["__file","389d18c2.html.vue"]]);export{_ as default};
diff --git a/assets/404.html-54df78f4.js b/assets/404.html-54df78f4.js
new file mode 100644
index 0000000..a18c44a
--- /dev/null
+++ b/assets/404.html-54df78f4.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-3706649a","path":"/404.html","title":"","lang":"en-US","frontmatter":{"layout":"NotFound","head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/404.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/404.html\\",\\"headline\\":\\"\\",\\"name\\":\\"\\",\\"datePublished\\":\\"0000-00-00\\",\\"dateModified\\":\\"0000-00-00\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/404.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]]},"headers":[]}`);export{t as data};
diff --git a/assets/404.html-683716ce.js b/assets/404.html-683716ce.js
new file mode 100644
index 0000000..6156fac
--- /dev/null
+++ b/assets/404.html-683716ce.js
@@ -0,0 +1 @@
+import{_ as e,o as c,c as t}from"./app-5c46a61a.js";const _={};function o(r,n){return c(),t("div")}const a=e(_,[["render",o],["__file","404.html.vue"]]);export{a as default};
diff --git a/assets/49af668f.html-4f108862.js b/assets/49af668f.html-4f108862.js
new file mode 100644
index 0000000..23c352c
--- /dev/null
+++ b/assets/49af668f.html-4f108862.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-65e4fc7a","path":"/8612fa7f/e00fc567/5ac6f809/49af668f.html","title":"一个bug","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/5ac6f809/49af668f.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/5ac6f809/49af668f.html\\",\\"headline\\":\\"一个bug\\",\\"name\\":\\"一个bug\\",\\"datePublished\\":\\"2020-03-14\\",\\"dateModified\\":\\"2020-03-14\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/5ac6f809/49af668f.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"java\\",\\"dyt\\",\\"dragondyt\\",\\"BigDecimal\\",\\"Integer\\",\\"java.math.BigDecimal cannot be cast to java.lang.Integer\\"]}"]],"title":"一个bug","tags":[{"name":"安卓","path":"/tags/e00fc567"}],"categories":[{"name":"bug","path":"/categories/bug"}],"keywords":["java","dyt","dragondyt","BigDecimal","Integer","java.math.BigDecimal cannot be cast to java.lang.Integer"],"date":"2020-03-14T21:55:57.000Z","abbrlink":"49af668f","permalink":"/8612fa7f/e00fc567/5ac6f809/49af668f.html"},"headers":[{"level":2,"title":"一个让人烦躁的bug","slug":"一个让人烦躁的bug","link":"#一个让人烦躁的bug","children":[]}]}`);export{t as data};
diff --git a/assets/49af668f.html-6cc33c8c.js b/assets/49af668f.html-6cc33c8c.js
new file mode 100644
index 0000000..bfc1f88
--- /dev/null
+++ b/assets/49af668f.html-6cc33c8c.js
@@ -0,0 +1 @@
+import{_ as t,o as e,c as a,e as n}from"./app-5c46a61a.js";const i={},l=n('
select MONTH(日期) as month,SUM(amount) AS total FROM `销售` where YEAR(日期) = #{year} GROUP BY MONTH(日期);\n
',7),r=[l];function s(c,o){return e(),a("div",null,r)}const g=t(i,[["render",s],["__file","49af668f.html.vue"]]);export{g as default};
diff --git a/assets/589e13eb.html-4d1c0041.js b/assets/589e13eb.html-4d1c0041.js
new file mode 100644
index 0000000..8d521f4
--- /dev/null
+++ b/assets/589e13eb.html-4d1c0041.js
@@ -0,0 +1 @@
+import{_ as p,o as C,c as B,e as A}from"./app-5c46a61a.js";const l={},D=A('
',67),t=[D];function e(r,o){return C(),B("div",null,t)}const a=p(l,[["render",e],["__file","589e13eb.html.vue"]]);export{a as default};
diff --git a/assets/589e13eb.html-ccdb7b95.js b/assets/589e13eb.html-ccdb7b95.js
new file mode 100644
index 0000000..490ef6d
--- /dev/null
+++ b/assets/589e13eb.html-ccdb7b95.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-12caed67","path":"/8612fa7f/e255a10a/a87da565/589e13eb.html","title":"计算机网络第三章数据链路层答案","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/e255a10a/a87da565/589e13eb.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/e255a10a/a87da565/589e13eb.html\\",\\"headline\\":\\"计算机网络第三章数据链路层答案\\",\\"name\\":\\"计算机网络第三章数据链路层答案\\",\\"description\\":\\"用来偷懒的答案\\",\\"datePublished\\":\\"2020-03-16\\",\\"dateModified\\":\\"2020-03-16\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/e255a10a/a87da565/589e13eb.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"计算机网络作业\\",\\"数据链路层课堂练习\\",\\"秦时明月的博客\\",\\"dyt\\",\\"dragondyt\\"]}"]],"title":"计算机网络第三章数据链路层答案","tags":[{"name":"计算机网络","path":"/tags/e255a10a"}],"categories":[{"name":"计算机网络","path":"/categories/e255a10a"}],"description":"用来偷懒的答案","notShow":true,"keywords":["计算机网络作业","数据链路层课堂练习","秦时明月的博客","dyt","dragondyt"],"date":"2020-03-16T19:22:27.000Z","abbrlink":"589e13eb","permalink":"/8612fa7f/e255a10a/a87da565/589e13eb.html"},"headers":[{"level":2,"title":"第三章 数据链路层","slug":"第三章-数据链路层","link":"#第三章-数据链路层","children":[]}]}`);export{t as data};
diff --git a/assets/5eef9793.html-dd485dea.js b/assets/5eef9793.html-dd485dea.js
new file mode 100644
index 0000000..d324d71
--- /dev/null
+++ b/assets/5eef9793.html-dd485dea.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-5b013ee8","path":"/8612fa7f/e255a10a/a87da565/5eef9793.html","title":"计算机网络第二章物理层课堂练习答案","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/e255a10a/a87da565/5eef9793.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/e255a10a/a87da565/5eef9793.html\\",\\"headline\\":\\"计算机网络第二章物理层课堂练习答案\\",\\"name\\":\\"计算机网络第二章物理层课堂练习答案\\",\\"description\\":\\"用来偷懒的答案\\",\\"datePublished\\":\\"2020-03-15\\",\\"dateModified\\":\\"2020-03-15\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/e255a10a/a87da565/5eef9793.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"计算机网络\\",\\"物理层课堂练习\\",\\"秦时明月的博客\\",\\"dyt\\",\\"dragondyt\\"]}"]],"title":"计算机网络第二章物理层课堂练习答案","tags":[{"name":"计算机网络","path":"/tags/e255a10a"}],"categories":[{"name":"计算机网络","path":"/categories/e255a10a"}],"description":"用来偷懒的答案","notShow":true,"comments":false,"keywords":["计算机网络","物理层课堂练习","秦时明月的博客","dyt","dragondyt"],"date":"2020-03-15T19:22:27.000Z","abbrlink":"5eef9793","permalink":"/8612fa7f/e255a10a/a87da565/5eef9793.html"},"headers":[{"level":2,"title":"第二章 物理层","slug":"第二章-物理层","link":"#第二章-物理层","children":[]}]}`);export{t as data};
diff --git a/assets/5eef9793.html-edf9c100.js b/assets/5eef9793.html-edf9c100.js
new file mode 100644
index 0000000..7ea5a3c
--- /dev/null
+++ b/assets/5eef9793.html-edf9c100.js
@@ -0,0 +1 @@
+import{_ as r,o as b,c as A,e as B}from"./app-5c46a61a.js";const D={},C=B('
数据通信的任务是传输( D )代码的比特序列。 A. 十进制 B. 帧结构 C. 分组结构 D. 二进制
( B )信号的电平是连续变化的。 A. 数字 B. 模拟 C. 脉冲 D. 二进制
( C)是指将数字信号转变成可以在电话线上传输的模拟信号的过程。 A. 解调 B. 采样 C. 调制 D. 压缩
数据传输速率是指每秒钟传输构成数据二进制代码的(D )数。 A. 码元 B. 信元 C. 波特 D. 位
利用模拟通信信道传输数据信号的方法称为( A )。 A. 频带传输 B. 基带传输 C. 异步传输 D. 同步传输
基带传输是指在数字通信信道上( C )传输数字数据信号的方法。 A. 调制 B. 脉冲编码 C. 直接 D. 间接
数据在通信信道传输的过程中,对数据传输的误码率影响最主要的因素是( D )。 A. 传输速率 B. 调制解调器 C. 传输介质 D. 噪声强度 9.Internet上的数据交换采用的是( A )。 A. 分组交换 B. 电路交换 C. 报文交换 D. 光交换
FDM是指( A )。 A. 频分多路复用 B. 时分多路复用 C. 波分多路复用 D. 码分多路利用
利用( A ),数字数据可以用模拟信号来表示。 A. 调制解调器 B. 编码解码器 C. 串联放大器 D. 电话网络
在数据通信系统中,传输介质的功能是( D )。 A. 在信源与信宿之间传输信息 B.纠正传输过程中的错误 C. 根据环境状况自动调整信号形式 D. 将信号从一端传至另一端
在光纤中采用的多路复用技术是( C )。 A. 时分多路复用 B. 频分多路复用 C. 波分多路复用 D. 码分多路复用
为了实现长距离传输,模拟传输系统都使用放大器来使信号中的能量得到增加,其噪声分量( A )。 A. 增大 B. 减小 C. 不变 D. 不一定
“复用”是一种将若干个彼此独立的信号合并为一个可在同一信道上传输的( C )。 A. 调制信号 B. 已调信号 C. 复用信号 D. 单边带信号
物理层4个重要特性:机械特性、功能特性、电气特性和(A)。 A. 规程特性 B. 接口特性 C.协议特性 D. 物理特性 17. 基带系统使用(C)进行传输的。 A. 模拟信号 B. 调制信号 C. 数字信号 D. 载波信号 18. 下列关于异步传输说法正确的是(D)。 A. 一次传输一个数据块 B. 对时序的要求较高 C. 收/发端不需要进行同步 D. 数据传输速率低 19. 低通通道带宽为5KHz,编码采用512级分级信号,最大数据传输率(D)。 A. 32 kbps B. 48 kbps C. 64 kbps D. 90 kbps
',3),l=[C];function i(e,s){return b(),A("div",null,l)}const p=r(D,[["render",i],["__file","5eef9793.html.vue"]]);export{p as default};
diff --git a/assets/69a9925d.html-14f67bc6.js b/assets/69a9925d.html-14f67bc6.js
new file mode 100644
index 0000000..97cdbaf
--- /dev/null
+++ b/assets/69a9925d.html-14f67bc6.js
@@ -0,0 +1,27 @@
+import{_ as e,o as t,c as s,a as n}from"./app-5c46a61a.js";const l={},a=n("pre",null,[n("code",{class:"language-java"},`/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode(int x) {
+ * val = x;
+ * next = null;
+ * }
+ * }
+ */
+public class Solution {
+ public boolean hasCycle(ListNode head) {
+ ListNode fast = head, slow = head;
+ // 快指针走到末尾时停止
+ while (fast != null && fast.next != null) {
+ slow = slow.next;
+ fast = fast.next.next;
+ // 快慢指针相遇,说明含有环
+ if (slow == fast) {
+ return true;
+ }
+ }
+ return false;
+ }
+}
+`)],-1),o=[a];function i(c,d){return t(),s("div",null,o)}const f=e(l,[["render",i],["__file","69a9925d.html.vue"]]);export{f as default};
diff --git a/assets/69a9925d.html-792e5ae6.js b/assets/69a9925d.html-792e5ae6.js
new file mode 100644
index 0000000..424dcb0
--- /dev/null
+++ b/assets/69a9925d.html-792e5ae6.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-905b9eea","path":"/8612fa7f/b7e144d1/2362a8ea/69a9925d.html","title":"[141]环形链表","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"链表\\",\\"item\\":\\"https://blog.dragondyt.top/categories/2362a8ea\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/69a9925d.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/69a9925d.html\\",\\"headline\\":\\"[141]环形链表\\",\\"name\\":\\"[141]环形链表\\",\\"datePublished\\":\\"2022-08-03\\",\\"dateModified\\":\\"2022-08-03\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/69a9925d.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[141]环形链表","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"链表","path":"/categories/2362a8ea"}],"tags":[{"name":"链表","path":"/tags/2362a8ea"},{"name":"快慢指针","path":"/tags/76495b47"}],"date":"2022-08-03 15:57:27","abbrlink":"69a9925d","permalink":"/8612fa7f/b7e144d1/2362a8ea/69a9925d.html"},"headers":[]}`);export{t as data};
diff --git a/assets/6d80ff7f.html-548940fd.js b/assets/6d80ff7f.html-548940fd.js
new file mode 100644
index 0000000..498b30d
--- /dev/null
+++ b/assets/6d80ff7f.html-548940fd.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-2a6e24b9","path":"/8612fa7f/b7e144d1/2362a8ea/6d80ff7f.html","title":"[876]链表的中间结点","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"链表\\",\\"item\\":\\"https://blog.dragondyt.top/categories/2362a8ea\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/6d80ff7f.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/6d80ff7f.html\\",\\"headline\\":\\"[876]链表的中间结点\\",\\"name\\":\\"[876]链表的中间结点\\",\\"datePublished\\":\\"2022-08-03\\",\\"dateModified\\":\\"2022-08-03\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/6d80ff7f.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[876]链表的中间结点","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"链表","path":"/categories/2362a8ea"}],"tags":[{"name":"链表","path":"/tags/2362a8ea"}],"date":"2022-08-03 15:44:27","abbrlink":"6d80ff7f","permalink":"/8612fa7f/b7e144d1/2362a8ea/6d80ff7f.html"},"headers":[]}`);export{t as data};
diff --git a/assets/6d80ff7f.html-5c35da4b.js b/assets/6d80ff7f.html-5c35da4b.js
new file mode 100644
index 0000000..5aaa8a6
--- /dev/null
+++ b/assets/6d80ff7f.html-5c35da4b.js
@@ -0,0 +1,26 @@
+import{_ as e,o as t,c as s,a as n}from"./app-5c46a61a.js";const l={},a=n("pre",null,[n("code",{class:"language-java"},`/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode() {}
+ * ListNode(int val) { this.val = val; }
+ * ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+ public ListNode middleNode(ListNode head) {
+ //简单的话应该是循环一遍,获取长度,如果是偶数则长度加一,然后获取中点,再循环一次
+ // 快慢指针初始化指向 head
+ ListNode slow = head, fast = head;
+ // 快指针走到末尾时停止
+ while (fast != null && fast.next != null) {
+ // 慢指针走一步,快指针走两步
+ slow = slow.next;
+ fast = fast.next.next;
+ }
+ // 慢指针指向中点
+ return slow;
+ }
+}
+`)],-1),o=[a];function i(d,c){return t(),s("div",null,o)}const _=e(l,[["render",i],["__file","6d80ff7f.html.vue"]]);export{_ as default};
diff --git a/assets/74684463.html-21bb8fa5.js b/assets/74684463.html-21bb8fa5.js
new file mode 100644
index 0000000..44ca880
--- /dev/null
+++ b/assets/74684463.html-21bb8fa5.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-67bb3c93","path":"/8612fa7f/47867b98/Flutter/74684463.html","title":"AAPT: error: resource android:attr/fontVariationSettings not found","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"踩坑\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7cf68d8\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"flutter\\",\\"item\\":\\"https://blog.dragondyt.top/categories/flutter\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Flutter/74684463.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Flutter/74684463.html\\",\\"headline\\":\\"AAPT: error: resource android:attr/fontVariationSettings not found\\",\\"name\\":\\"AAPT: error: resource android:attr/fontVariationSettings not found\\",\\"datePublished\\":\\"2020-05-09\\",\\"dateModified\\":\\"2020-05-09\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Flutter/74684463.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"AAPT: error: resource android:attr/fontVariationSettings not found\\"]}"]],"title":"AAPT: error: resource android:attr/fontVariationSettings not found","tags":[{"name":"吐槽","path":"/tags/62f4a42b"},{"name":"flutter","path":"/tags/flutter"}],"categories":[{"name":"踩坑","path":"/categories/b7cf68d8"},{"name":"flutter","path":"/categories/flutter"}],"keywords":["AAPT: error: resource android:attr/fontVariationSettings not found"],"date":"2020-05-09T10:54:35.000Z","abbrlink":"74684463","permalink":"/8612fa7f/47867b98/Flutter/74684463.html"},"headers":[{"level":2,"title":"心累,每天都是“惊喜”,我太菜了","slug":"心累-每天都是-惊喜-我太菜了","link":"#心累-每天都是-惊喜-我太菜了","children":[]}]}`);export{t as data};
diff --git a/assets/74684463.html-c0ecf027.js b/assets/74684463.html-c0ecf027.js
new file mode 100644
index 0000000..b8a172e
--- /dev/null
+++ b/assets/74684463.html-c0ecf027.js
@@ -0,0 +1,43 @@
+import{_ as e,o as n,c as o,e as r}from"./app-5c46a61a.js";const t={},a=r(`
`,11),d=[a];function i(s,l){return n(),o("div",null,d)}const u=e(t,[["render",i],["__file","74684463.html.vue"]]);export{u as default};
diff --git a/assets/76a66db0.html-691d3a71.js b/assets/76a66db0.html-691d3a71.js
new file mode 100644
index 0000000..f51373d
--- /dev/null
+++ b/assets/76a66db0.html-691d3a71.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-e9d2e9e4","path":"/8612fa7f/b7e144d1/340249a9/76a66db0.html","title":"[2073]买票需要的时间","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"二叉树\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1/e85d694a\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/340249a9/76a66db0.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/340249a9/76a66db0.html\\",\\"headline\\":\\"[2073]买票需要的时间\\",\\"name\\":\\"[2073]买票需要的时间\\",\\"datePublished\\":\\"2022-08-04\\",\\"dateModified\\":\\"2022-08-04\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/340249a9/76a66db0.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[2073]买票需要的时间","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"二叉树","path":"/categories/b7e144d1/e85d694a"}],"tags":[{"name":"队列","path":"/tags/b6c47025"},{"name":"数组","path":"/tags/340249a9"}],"date":"2022-08-04 09:48:19","abbrlink":"76a66db0","permalink":"/8612fa7f/b7e144d1/340249a9/76a66db0.html"},"headers":[]}`);export{t as data};
diff --git a/assets/76a66db0.html-bdbcb783.js b/assets/76a66db0.html-bdbcb783.js
new file mode 100644
index 0000000..395949c
--- /dev/null
+++ b/assets/76a66db0.html-bdbcb783.js
@@ -0,0 +1,14 @@
+import{_ as e,o as n,c as i,a as t}from"./app-5c46a61a.js";const c={},s=t("pre",null,[t("code",{class:"language-java"},`class Solution {
+ public int timeRequiredToBuy(int[] tickets, int k) {
+ int ret = 0;
+ for (int i = 0; i < tickets.length; i++) {
+ if (i <= k) {
+ ret = ret + Math.min(tickets[i], tickets[k]);
+ } else {
+ ret = ret + Math.min(tickets[i], tickets[k] - 1);
+ }
+ }
+ return ret;
+ }
+}
+`)],-1),r=[s];function a(o,l){return n(),i("div",null,r)}const k=e(c,[["render",a],["__file","76a66db0.html.vue"]]);export{k as default};
diff --git a/assets/77c5fdb1.html-0bd7b0da.js b/assets/77c5fdb1.html-0bd7b0da.js
new file mode 100644
index 0000000..827b84b
--- /dev/null
+++ b/assets/77c5fdb1.html-0bd7b0da.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-a4e6871e","path":"/8612fa7f/b7e144d1/e85d694a/77c5fdb1.html","title":"[230]二叉搜索树中第K小的元素","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"二叉树\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1/e85d694a\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/e85d694a/77c5fdb1.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/e85d694a/77c5fdb1.html\\",\\"headline\\":\\"[230]二叉搜索树中第K小的元素\\",\\"name\\":\\"[230]二叉搜索树中第K小的元素\\",\\"datePublished\\":\\"2022-07-20\\",\\"dateModified\\":\\"2022-07-20\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/e85d694a/77c5fdb1.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[230]二叉搜索树中第K小的元素","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"二叉树","path":"/categories/b7e144d1/e85d694a"}],"tags":[{"name":"二叉树","path":"/tags/e85d694a"}],"date":"2022-07-20 14:24:17","abbrlink":"77c5fdb1","permalink":"/8612fa7f/b7e144d1/e85d694a/77c5fdb1.html"},"headers":[]}`);export{t as data};
diff --git a/assets/77c5fdb1.html-1316a7c0.js b/assets/77c5fdb1.html-1316a7c0.js
new file mode 100644
index 0000000..a17e03e
--- /dev/null
+++ b/assets/77c5fdb1.html-1316a7c0.js
@@ -0,0 +1,21 @@
+import{_ as n,o as r,c as t,a as e}from"./app-5c46a61a.js";const o={},a=e("pre",null,[e("code",{class:"language-java"},`class Solution {
+ int rank,res = 0;
+ public int kthSmallest(TreeNode root, int k) {
+ traverse(root,k);
+ return res;
+ }
+ private void traverse(TreeNode root, int k) {
+ if (root == null) {
+ return;
+ }
+ traverse(root.left,k);
+ //二叉搜索树的特点,若任意节点的左子树不空,则左子树上所有结点的值均小于它的根结点的值,因此先序遍历的就是第k小
+ rank++;
+ if (k == rank) {
+ res = root.val;
+ return;
+ }
+ traverse(root.right,k);
+ }
+}
+`)],-1),s=[a];function c(l,i){return r(),t("div",null,s)}const d=n(o,[["render",c],["__file","77c5fdb1.html.vue"]]);export{d as default};
diff --git a/assets/79abcd0d.html-225294be.js b/assets/79abcd0d.html-225294be.js
new file mode 100644
index 0000000..73cfea2
--- /dev/null
+++ b/assets/79abcd0d.html-225294be.js
@@ -0,0 +1,4 @@
+import{_ as a,r as c,o as i,c as d,a as o,b as e,d as n,w as l,e as r}from"./app-5c46a61a.js";const s={},h=r('
',4),A=o("p",null,"🔧 修复一些BUG",-1),B=o("h2",{id:"_0-2-3-👉-0-2-4",tabindex:"-1"},[o("a",{class:"header-anchor",href:"#_0-2-3-👉-0-2-4","aria-hidden":"true"},"#"),e(" 0.2.3 👉 0.2.4")],-1),g=o("p",null,[e("⚠️ "),o("strong",null,"评论功能更新")],-1),k=o("li",null,[e("MiniValine魔改版更新至beta10,修改过主题默认"),o("code",null,"_config.yml"),e("的同学,记得更新末尾的"),o("code",null,"vendors"),e("到最新哦")],-1),x=o("ul",null,[o("li",null,"主要增加的Tag配置,现在可以各种自定义啦")],-1),w=o("p",null,"⚠️ 配置新增",-1),y=o("code",null,"darkmode",-1),D=o("code",null,"auto_scroll",-1),V=o("code",null,"image_server",-1),C=o("ul",null,[o("li",null,"可以添加多个播放列表"),o("li",null,"加了一些控制按钮")],-1),v=o("code",null,"media",-1),F=o("br",null,null,-1),j=o("p",null,[e("🔧 随机图库支持非渣浪图床的任意图片"),o("br"),e(" 🔧 还有许多小BUG")],-1),G=o("h2",{id:"_0-2-2-👉-0-2-3",tabindex:"-1"},[o("a",{class:"header-anchor",href:"#_0-2-2-👉-0-2-3","aria-hidden":"true"},"#"),e(" 0.2.2 👉 0.2.3")],-1),N=o("br",null,null,-1),P=o("h2",{id:"_0-2-1-👉-0-2-2",tabindex:"-1"},[o("a",{class:"header-anchor",href:"#_0-2-1-👉-0-2-2","aria-hidden":"true"},"#"),e(" 0.2.1 👉 0.2.2")],-1),T=o("code",null,"mediumzoom",-1),M=o("code",null,"fancybox",-1),U=o("br",null,null,-1),z=o("code",null,"繁体中文",-1),H=o("code",null,"日语",-1),I=o("br",null,null,-1),L=o("br",null,null,-1),O=o("br",null,null,-1),Q=o("code",null,"audio: false",-1),R=o("h2",{id:"_0-2-👉-0-2-1",tabindex:"-1"},[o("a",{class:"header-anchor",href:"#_0-2-👉-0-2-1","aria-hidden":"true"},"#"),e(" 0.2 👉 0.2.1")],-1),S=o("code",null,"loader",-1),q=o("br",null,null,-1),J=o("br",null,null,-1),K=o("br",null,null,-1),W=o("br",null,null,-1),X=o("h2",{id:"_0-1-9-👉-0-2",tabindex:"-1"},[o("a",{class:"header-anchor",href:"#_0-1-9-👉-0-2","aria-hidden":"true"},"#"),e(" 0.1.9 👉 0.2")],-1),Y=o("p",null,[e("⚠️ "),o("strong",null,"评论功能大改")],-1),Z=o("li",null,[e("弃用不开源的Valine,改用MiniValine,并且进行了魔改,"),o("a",{href:"https://github.com/amehime/MiniValine",target:"_blank",rel:"noopener noreferrer"},"项目戳此"),o("br"),e(" 主要是大量压缩了代码,弃用一些花里胡哨的功能,又加了一些别的花里胡哨的功能。")],-1),$=o("li",null,[e("为防止泄露用户邮箱、IP等隐私信息,弃用QQ号获取昵称及头像。"),o("br"),e(" ❗ 同时需要手动进行一些迁移,"),o("a",{href:"https://github.com/imaegoo/Valine",target:"_blank",rel:"noopener noreferrer"},"具体步骤戳此")],-1),ee=o("br",null,null,-1),oe=o("br",null,null,-1),te=o("code",null,"i-douban",-1),ne=o("br",null,null,-1);function le(re,ae){const t=c("RouterLink");return i(),d("div",null,[h,o("p",null,[e(":::primary"),u,n(t,{to:"/computer-science/note/theme-shoka-doc/"},{default:l(()=>[_]),_:1}),e(" - "),n(t,{to:"/computer-science/note/theme-shoka-doc/dependents/"},{default:l(()=>[e("💌依赖插件")]),_:1}),e(" - "),n(t,{to:"/computer-science/note/theme-shoka-doc/config/"},{default:l(()=>[e("📌基本配置")]),_:1}),e(" - "),n(t,{to:"/computer-science/note/theme-shoka-doc/display/"},{default:l(()=>[e("🌈界面显示")]),_:1}),e(" - "),n(t,{to:"/computer-science/note/theme-shoka-doc/special/"},{default:l(()=>[e("🦄特殊功能")]),_:1}),p,e(" :::")]),m,o("p",null,[n(t,{to:"/computer-science/note/dependents/"},{default:l(()=>[e("插件安装与配置教程戳此")]),_:1})]),E,o("p",null,[n(t,{to:"/computer-science/note/config/"},{default:l(()=>[e("主题的基础配置可以参考这里")]),_:1}),f,n(t,{to:"/computer-science/note/display/"},{default:l(()=>[e("界面显示相关的配置参考这里")]),_:1})]),b,o("ul",null,[o("li",null,[n(t,{to:"/computer-science/note/display/#%E8%87%AA%E5%AE%9A%E4%B9%89%E9%A1%B5%E9%9D%A2%E9%85%8D%E8%89%B2"},{default:l(()=>[e("样式")]),_:1}),e(":包括配色、"),n(t,{to:"/computer-science/note/config/#iconfont%E5%9B%BE%E6%A0%87"},{default:l(()=>[e("icon")]),_:1}),e("、其他自定义样式")]),o("li",null,[e("图片:包括"),n(t,{to:"/computer-science/note/display/#%E8%87%AA%E5%AE%9A%E4%B9%89%E4%B8%BB%E9%A2%98%E5%9B%BE%E7%89%87"},{default:l(()=>[e("主题图片")]),_:1}),e("、"),n(t,{to:"/computer-science/note/config/#%E9%9A%8F%E6%9C%BA%E5%9B%BE%E5%BA%93"},{default:l(()=>[e("随机图库")]),_:1})])]),A,B,g,o("ul",null,[k,o("li",null,[e("❗ 评论相关的配置有更新,"),n(t,{to:"/computer-science/note/config/#%E6%96%87%E7%AB%A0%E8%AF%84%E8%AE%BA"},{default:l(()=>[e("配置戳此")]),_:1}),x])]),w,o("ul",null,[o("li",null,[e("夜间模式"),y,e(","),n(t,{to:"/computer-science/note/config/#%E5%A4%9C%E9%97%B4%E6%A8%A1%E5%BC%8F"},{default:l(()=>[e("配置戳此")]),_:1})]),o("li",null,[e("自动定位"),D,e(","),n(t,{to:"/computer-science/note/config/#%E8%87%AA%E5%8A%A8%E5%AE%9A%E4%BD%8D"},{default:l(()=>[e("配置戳此")]),_:1})]),o("li",null,[e("图床API设置"),V,e(","),n(t,{to:"/computer-science/note/config/#%E9%9A%8F%E6%9C%BA%E5%9B%BE%E5%BA%93"},{default:l(()=>[e("配置戳此")]),_:1})])]),o("p",null,[e("⚠️ 背景音乐功能增强,"),n(t,{to:"/computer-science/note/config/#%E8%83%8C%E6%99%AF%E9%9F%B3%E4%B9%90"},{default:l(()=>[e("配置戳此")]),_:1})]),C,o("p",null,[e("⚠️ 增加"),v,e("标签,在文章中插入音频和视频播放列表,"),n(t,{to:"/computer-science/note/special/#media%E5%A4%9A%E5%AA%92%E4%BD%93"},{default:l(()=>[e("方法戳此")]),_:1}),F,e(" ⌛ 视频播放器有待增强(显示分段标签,字幕)")]),j,G,o("p",null,[e("❗ 增加主题文件外自定义语言包的功能,"),n(t,{to:"/computer-science/note/display/#%E8%87%AA%E5%AE%9A%E4%B9%89%E8%AF%AD%E8%A8%80%E5%8C%85"},{default:l(()=>[e("配置戳此")]),_:1}),N,e(" 🔧 提高低版本浏览器兼容性")]),P,o("p",null,[e("⚠️ 弃用"),T,e(",改成"),M,e(","),n(t,{to:"/computer-science/note/display/#%E5%9B%BE%E7%89%87%E5%B1%95%E7%A4%BA%E4%B8%8E%E7%9B%B8%E5%86%8C"},{default:l(()=>[e("配置戳此")]),_:1}),U,e(" 💡 增加语言包:"),z,e("和"),H,I,e(" 💡 quiz功能优化,根据语言显示题型标签"),L,e(" 🔧 修复评论功能中反复初始化leancloud-storage"),O,e(" 🔧 修复"),Q,e("时不能隐藏播放按钮、停止播放")]),R,o("p",null,[e("⚠️ 配置文件添加 "),S,e(" 参数,"),n(t,{to:"/computer-science/note/config/#%E5%8A%A0%E8%BD%BD%E5%8A%A8%E7%94%BB"},{default:l(()=>[e("配置戳此")]),_:1}),q,e(" 💡 二级list区别显示"),J,e(" 🔧 修复浏览位置定位BUG"),K,e(" 🔧 修复firework动画延迟"),W,e(" 🔧 优化评论功能")]),X,Y,o("ul",null,[Z,$,o("li",null,[e("❗ 评论相关的配置亦有更新,"),n(t,{to:"/computer-science/note/config/#%E6%96%87%E7%AB%A0%E8%AF%84%E8%AE%BA"},{default:l(()=>[e("配置戳此")]),_:1})])]),o("p",null,[e("⚠️ 增加单击页面烟花效果,"),n(t,{to:"/computer-science/note/config/#%E9%A1%B5%E9%9D%A2%E7%89%B9%E6%95%88"},{default:l(()=>[e("配置戳此")]),_:1}),ee,e(" 💡 弃用Velocity,改用anime.js,方便未来添加更多!!花里胡哨的!!功能!!严重拖慢页面滑行速度!!"),oe,e(" 🔧 新增多枚icon,包括豆瓣"),te,e("等"),ne,e(" 🔧 一些显示问题")])])}const ie=a(s,[["render",le],["__file","79abcd0d.html.vue"]]);export{ie as default};
diff --git a/assets/79abcd0d.html-47af4901.js b/assets/79abcd0d.html-47af4901.js
new file mode 100644
index 0000000..636cece
--- /dev/null
+++ b/assets/79abcd0d.html-47af4901.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-04d0e708","path":"/computer-science/note/79abcd0d.html","title":"Hexo主题Shoka & multi-markdown-it渲染器使用说明","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"二进制杂谈\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622/97a3d3dd\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"Theme Shoka Documentation\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622/97a3d3dd/Theme-Shoka-Documentation\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/computer-science/note/79abcd0d.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/computer-science/note/79abcd0d.html\\",\\"headline\\":\\"Hexo主题Shoka & multi-markdown-it渲染器使用说明\\",\\"name\\":\\"Hexo主题Shoka & multi-markdown-it渲染器使用说明\\",\\"datePublished\\":\\"2020-08-13\\",\\"dateModified\\":\\"2020-08-13\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/computer-science/note/79abcd0d.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"Hexo主题Shoka & multi-markdown-it渲染器使用说明","date":"2020-08-13T20:45:48.000Z","update":"2020-09-27T00:00:00.000Z","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"二进制杂谈","path":"/categories/11159622/97a3d3dd"},{"name":"Theme Shoka Documentation","path":"/categories/11159622/97a3d3dd/Theme-Shoka-Documentation"}],"tags":[{"name":"Hexo","path":"/tags/Hexo"},{"name":"教程","path":"/tags/1868f51e"}],"sticky":true,"valine":{"placeholder":"1. 提问前请先仔细阅读本文档⚡\\n2. 页面显示问题💥,请提供控制台截图📸或者您的测试网址\\n3. 其他任何报错💣,请提供详细描述和截图📸,祝食用愉快💪"},"permalink":"/computer-science/note/79abcd0d.html","abbrlink":"79abcd0d"},"headers":[{"level":1,"title":"设计缘由","slug":"设计缘由","link":"#设计缘由","children":[]},{"level":1,"title":"快速安装","slug":"快速安装","link":"#快速安装","children":[]},{"level":1,"title":"安装依赖插件","slug":"安装依赖插件","link":"#安装依赖插件","children":[]},{"level":1,"title":"应用主题","slug":"应用主题","link":"#应用主题","children":[{"level":2,"title":"修改站点配置","slug":"修改站点配置","link":"#修改站点配置","children":[]},{"level":2,"title":"修改主题配置","slug":"修改主题配置","link":"#修改主题配置","children":[]}]},{"level":1,"title":"更新记录","slug":"更新记录","link":"#更新记录","children":[{"level":2,"title":"0.2.4 👉 0.2.5","slug":"_0-2-4-👉-0-2-5","link":"#_0-2-4-👉-0-2-5","children":[]},{"level":2,"title":"0.2.3 👉 0.2.4","slug":"_0-2-3-👉-0-2-4","link":"#_0-2-3-👉-0-2-4","children":[]},{"level":2,"title":"0.2.2 👉 0.2.3","slug":"_0-2-2-👉-0-2-3","link":"#_0-2-2-👉-0-2-3","children":[]},{"level":2,"title":"0.2.1 👉 0.2.2","slug":"_0-2-1-👉-0-2-2","link":"#_0-2-1-👉-0-2-2","children":[]},{"level":2,"title":"0.2 👉 0.2.1","slug":"_0-2-👉-0-2-1","link":"#_0-2-👉-0-2-1","children":[]},{"level":2,"title":"0.1.9 👉 0.2","slug":"_0-1-9-👉-0-2","link":"#_0-1-9-👉-0-2","children":[]}]}]}`);export{t as data};
diff --git a/assets/7cab1e06.html-93a7ff90.js b/assets/7cab1e06.html-93a7ff90.js
new file mode 100644
index 0000000..ae37d21
--- /dev/null
+++ b/assets/7cab1e06.html-93a7ff90.js
@@ -0,0 +1 @@
+import{_ as l,o as n,c as t,a as e,b as o}from"./app-5c46a61a.js";const c={},s=e("p",null,[e("strong",null,"别名"),e("br"),o(" 二叉搜索树,二叉查找树,BST,Binary Search Tree")],-1),_=e("p",null,[e("strong",null,"特点")],-1),r=e("ol",null,[e("li",null,"若任意节点的左子树不空,则左子树上所有结点的值均小于它的根结点的值;"),e("li",null,"任意节点的右子树不空,则右子树上所有结点的值均大于它的根结点的值;"),e("li",null,"任意节点的左、右子树也分别为二叉查找树;"),e("li",null,"没有键值相等的节点。")],-1),a=[s,_,r];function i(u,d){return n(),t("div",null,a)}const f=l(c,[["render",i],["__file","7cab1e06.html.vue"]]);export{f as default};
diff --git a/assets/7cab1e06.html-c789ffc2.js b/assets/7cab1e06.html-c789ffc2.js
new file mode 100644
index 0000000..fd733de
--- /dev/null
+++ b/assets/7cab1e06.html-c789ffc2.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-43b91011","path":"/8612fa7f/79666db/7b216a3b/7cab1e06.html","title":"二叉搜索树","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/79666db/7b216a3b/7cab1e06.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/79666db/7b216a3b/7cab1e06.html\\",\\"headline\\":\\"二叉搜索树\\",\\"name\\":\\"二叉搜索树\\",\\"datePublished\\":\\"2022-07-20\\",\\"dateModified\\":\\"2022-07-20\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/79666db/7b216a3b/7cab1e06.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"二叉搜索树","date":"2022-07-20 15:11:43","abbrlink":"7cab1e06","permalink":"/8612fa7f/79666db/7b216a3b/7cab1e06.html","categories":[],"tags":[]},"headers":[]}`);export{t as data};
diff --git a/assets/85a3718.html-bec2de7a.js b/assets/85a3718.html-bec2de7a.js
new file mode 100644
index 0000000..0ae7abf
--- /dev/null
+++ b/assets/85a3718.html-bec2de7a.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-6c73d6db","path":"/computer-science/note/theme-shoka-doc/85a3718.html","title":"Step.2 基本配置","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"二进制杂谈\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622/97a3d3dd\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"Theme Shoka Documentation\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622/97a3d3dd/Theme-Shoka-Documentation\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/computer-science/note/theme-shoka-doc/85a3718.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/computer-science/note/theme-shoka-doc/85a3718.html\\",\\"headline\\":\\"Step.2 基本配置\\",\\"name\\":\\"Step.2 基本配置\\",\\"datePublished\\":\\"2020-08-13\\",\\"dateModified\\":\\"2020-08-13\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/computer-science/note/theme-shoka-doc/85a3718.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"Step.2 基本配置","date":"2020-08-13T20:56:48.000Z","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"二进制杂谈","path":"/categories/11159622/97a3d3dd"},{"name":"Theme Shoka Documentation","path":"/categories/11159622/97a3d3dd/Theme-Shoka-Documentation"}],"tags":[{"name":"Hexo","path":"/tags/Hexo"},{"name":"教程","path":"/tags/1868f51e"}],"valine":{"placeholder":"1. 提问前请先仔细阅读本文档⚡\\n2. 页面显示问题💥,请提供控制台截图📸或者您的测试网址\\n3. 其他任何报错💣,请提供详细描述和截图📸,祝食用愉快💪"},"audio":["https://music.163.com/song?id=1387098940"],"permalink":"/computer-science/note/theme-shoka-doc/85a3718.html","abbrlink":"85a3718"},"headers":[{"level":1,"title":"站点别称","slug":"站点别称","link":"#站点别称","children":[]},{"level":1,"title":"静态文件目录","slug":"静态文件目录","link":"#静态文件目录","children":[]},{"level":1,"title":"夜间模式","slug":"夜间模式","link":"#夜间模式","children":[]},{"level":1,"title":"自动定位","slug":"自动定位","link":"#自动定位","children":[]},{"level":1,"title":"加载动画","slug":"加载动画","link":"#加载动画","children":[]},{"level":1,"title":"页面特效","slug":"页面特效","link":"#页面特效","children":[]},{"level":1,"title":"加载谷歌字体","slug":"加载谷歌字体","link":"#加载谷歌字体","children":[]},{"level":1,"title":"iconfont图标","slug":"iconfont图标","link":"#iconfont图标","children":[]},{"level":1,"title":"菜单与社交按钮","slug":"菜单与社交按钮","link":"#菜单与社交按钮","children":[]},{"level":1,"title":"边栏配置","slug":"边栏配置","link":"#边栏配置","children":[]},{"level":1,"title":"底部widgets","slug":"底部widgets","link":"#底部widgets","children":[]},{"level":1,"title":"字数及阅读时间统计","slug":"字数及阅读时间统计","link":"#字数及阅读时间统计","children":[]},{"level":1,"title":"文章评论","slug":"文章评论","link":"#文章评论","children":[]},{"level":1,"title":"背景音乐","slug":"背景音乐","link":"#背景音乐","children":[]},{"level":1,"title":"随机图库","slug":"随机图库","link":"#随机图库","children":[]},{"level":1,"title":"加载第三方组件","slug":"加载第三方组件","link":"#加载第三方组件","children":[]}]}`);export{t as data};
diff --git a/assets/85a3718.html-fa6379ec.js b/assets/85a3718.html-fa6379ec.js
new file mode 100644
index 0000000..d096e66
--- /dev/null
+++ b/assets/85a3718.html-fa6379ec.js
@@ -0,0 +1,209 @@
+import{_ as c,r as d,o as s,c as i,a as o,b as e,d as a,w as n,e as r}from"./app-5c46a61a.js";const l={},u=o("br",null,null,-1),p=o("strong",null,"📌基本配置",-1),h=o("br",null,null,-1),m=r(`
font:
+ enable: true
+ # Font options:
+ # \`external: true\` will load this font family from \`host\` above.
+ # \`family: Times New Roman\`. Without any quotes.
+ # \`size: x.x\`. Use \`em\` as unit. Default: 1 (16px)
+
+ # Global font settings used for all elements inside <body>.
+ global:
+ external: true
+ family: Mulish
+ size:
+
+ # Font settings for alternate title.
+ logo:
+ external: true
+ family: Fredericka the Great
+ size: 3.5
+
+ # Font settings for site title.
+ title:
+ external: true
+ family: Noto Serif JP
+ size: 2.5
+
+ # Font settings for headlines (<h1> to <h6>).
+ headings:
+ external: true
+ family: Noto Serif SC
+ size:
+
+ # Font settings for posts.
+ posts:
+ external: true
+ family:
+
+ # Font settings for <code> and code blocks.
+ codes:
+ external: true
+ family: Inconsolata
+
`,36),g=o("h1",{id:"边栏配置",tabindex:"-1"},[o("a",{class:"header-anchor",href:"#边栏配置","aria-hidden":"true"},"#"),e(" 边栏配置")],-1),f=o("p",null,[e("边栏可以选择在左侧,或右侧"),o("br"),e(" 修改头像文件的地址,相对于静态文件目录"),o("code",null,"images"),e("中配置的路径。")],-1),b=o("pre",null,[o("code",{class:"language-yml"},`sidebar:
+ # Sidebar Position.
+ position: left
+ #position: right
+ # Replace the default avatar image and set the url here.
+ avatar: avatar.jpg
+`)],-1),q=o("code",null,"/source/_data/images/",-1),y=r(`
`,38);function _(w,x){const t=d("RouterLink");return s(),i("div",null,[o("p",null,[e(":::primary"),u,a(t,{to:"/computer-science/note/theme-shoka-doc/"},{default:n(()=>[e("🚀快速开始")]),_:1}),e(" - "),a(t,{to:"/computer-science/note/theme-shoka-doc/dependents/"},{default:n(()=>[e("💌依赖插件")]),_:1}),e(" - "),a(t,{to:"/computer-science/note/theme-shoka-doc/config/"},{default:n(()=>[p]),_:1}),e(" - "),a(t,{to:"/computer-science/note/theme-shoka-doc/display/"},{default:n(()=>[e("🌈界面显示")]),_:1}),e(" - "),a(t,{to:"/computer-science/note/theme-shoka-doc/special/"},{default:n(()=>[e("🦄特殊功能")]),_:1}),h,e(" :::")]),m,o("p",null,[e("菜单显示文字可以在语言包中定义,"),a(t,{to:"/computer-science/note/display/#%E8%87%AA%E5%AE%9A%E4%B9%89%E8%AF%AD%E8%A8%80%E5%8C%85"},{default:n(()=>[e("具体请戳这里")]),_:1})]),g,f,b,o("p",null,[e("可以将自己的图片放在"),q,e("目录,甚至以同名覆盖主题内默认的头像图片,"),a(t,{to:"/computer-science/note/display/#%E8%87%AA%E5%AE%9A%E4%B9%89%E4%B8%BB%E9%A2%98%E5%9B%BE%E7%89%87"},{default:n(()=>[e("具体请戳这里")]),_:1})]),y])}const v=c(l,[["render",_],["__file","85a3718.html.vue"]]);export{v as default};
diff --git a/assets/8f835b6d.html-4b5b4fee.js b/assets/8f835b6d.html-4b5b4fee.js
new file mode 100644
index 0000000..9424200
--- /dev/null
+++ b/assets/8f835b6d.html-4b5b4fee.js
@@ -0,0 +1,18 @@
+import{_ as e,o as t,c as o,a as n}from"./app-5c46a61a.js";const s={},a=n("pre",null,[n("code",{class:"language-java"},`class Solution {
+ public ListNode getKthFromEnd(ListNode head, int k) {
+ ListNode p1 = head;
+ // p1 先走 k 步
+ for (int i = 0; i < k; i++) {
+ p1 = p1.next;
+ }
+ ListNode p2 = head;
+ // p1 和 p2 同时走 n - k 步
+ while (p1 != null) {
+ p2 = p2.next;
+ p1 = p1.next;
+ }
+ // p2 现在指向第 n - k + 1 个节点,即倒数第 k 个节点
+ return p2;
+ }
+}
+`)],-1),c=[a];function p(i,l){return t(),o("div",null,c)}const r=e(s,[["render",p],["__file","8f835b6d.html.vue"]]);export{r as default};
diff --git a/assets/8f835b6d.html-c1f7f2e5.js b/assets/8f835b6d.html-c1f7f2e5.js
new file mode 100644
index 0000000..0d260fd
--- /dev/null
+++ b/assets/8f835b6d.html-c1f7f2e5.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-8a741eac","path":"/8612fa7f/b7e144d1/2362a8ea/8f835b6d.html","title":"[剑指 Offer 22]链表中倒数第k个节点","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"链表\\",\\"item\\":\\"https://blog.dragondyt.top/categories/2362a8ea\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/8f835b6d.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/8f835b6d.html\\",\\"headline\\":\\"[剑指 Offer 22]链表中倒数第k个节点\\",\\"name\\":\\"[剑指 Offer 22]链表中倒数第k个节点\\",\\"datePublished\\":\\"2022-07-28\\",\\"dateModified\\":\\"2022-07-28\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/8f835b6d.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[剑指 Offer 22]链表中倒数第k个节点","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"链表","path":"/categories/2362a8ea"}],"tags":[{"name":"链表","path":"/tags/2362a8ea"}],"date":"2022-07-28 16:59:09","abbrlink":"8f835b6d","permalink":"/8612fa7f/b7e144d1/2362a8ea/8f835b6d.html"},"headers":[]}`);export{t as data};
diff --git a/assets/9862a150.html-a983562a.js b/assets/9862a150.html-a983562a.js
new file mode 100644
index 0000000..e9c45f3
--- /dev/null
+++ b/assets/9862a150.html-a983562a.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-3551ab68","path":"/8612fa7f/b7e144d1/2362a8ea/9862a150.html","title":"[剑指 Offer II 022]链表中环的入口节点","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/9862a150.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/9862a150.html\\",\\"headline\\":\\"[剑指 Offer II 022]链表中环的入口节点\\",\\"name\\":\\"[剑指 Offer II 022]链表中环的入口节点\\",\\"datePublished\\":\\"2022-08-03\\",\\"dateModified\\":\\"2022-08-03\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/2362a8ea/9862a150.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[剑指 Offer II 022]链表中环的入口节点","tags":[{"name":"链表","path":"/tags/2362a8ea"},{"name":"快慢指针","path":"/tags/76495b47"}],"date":"2022-08-03 16:10:45","abbrlink":"9862a150","permalink":"/8612fa7f/b7e144d1/2362a8ea/9862a150.html","categories":[]},"headers":[]}`);export{t as data};
diff --git a/assets/9862a150.html-fc4d3a00.js b/assets/9862a150.html-fc4d3a00.js
new file mode 100644
index 0000000..e757091
--- /dev/null
+++ b/assets/9862a150.html-fc4d3a00.js
@@ -0,0 +1,34 @@
+import{_ as e,o as t,c as s,a as n}from"./app-5c46a61a.js";const l={},a=n("pre",null,[n("code",{class:"language-java"},`/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode(int x) {
+ * val = x;
+ * next = null;
+ * }
+ * }
+ */
+public class Solution {
+ public ListNode detectCycle(ListNode head) {
+ //如果用两个指针
+ ListNode fast = head, slow = head;
+ while (fast != null && fast.next != null) {
+ fast = fast.next.next;
+ slow = slow.next;
+ if (fast == slow) {
+ break;
+ }
+ }
+ if (fast == null || fast.next == null) {
+ return null;
+ }
+ slow = head;
+ while (slow!=fast){
+ slow = slow.next;
+ fast = fast.next;
+ }
+ return slow;
+ }
+}
+`)],-1),o=[a];function i(c,f){return t(),s("div",null,o)}const r=e(l,[["render",i],["__file","9862a150.html.vue"]]);export{r as default};
diff --git a/assets/9b7cc1d2.html-58a05574.js b/assets/9b7cc1d2.html-58a05574.js
new file mode 100644
index 0000000..5b0e622
--- /dev/null
+++ b/assets/9b7cc1d2.html-58a05574.js
@@ -0,0 +1,37 @@
+import{_ as t,o as n,c as e,e as o}from"./app-5c46a61a.js";const r={},l=o(`
/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ * int val;
+ * TreeNode left;
+ * TreeNode right;
+ * TreeNode() {}
+ * TreeNode(int val) { this.val = val; }
+ * TreeNode(int val, TreeNode left, TreeNode right) {
+ * this.val = val;
+ * this.left = left;
+ * this.right = right;
+ * }
+ * }
+ */
+class Solution {
+ int res = Integer.MIN_VALUE;
+
+ public int maxPathSum(TreeNode root) {
+ // 后序位置
+ oneSideMax(root);
+ return res;
+ }
+
+ private int oneSideMax(TreeNode root){
+ if (root == null) {
+ return 0;
+ }
+ int left = Math.max(0, oneSideMax(root.left));
+ int right = Math.max(0, oneSideMax(root.right));
+ res = Math.max(res, left + right + root.val);
+ return Math.max(left, right) + root.val;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
`,10),i=[l];function s(a,g){return n(),e("div",null,i)}const d=t(r,[["render",s],["__file","9b7cc1d2.html.vue"]]);export{d as default};
diff --git a/assets/9b7cc1d2.html-a318771d.js b/assets/9b7cc1d2.html-a318771d.js
new file mode 100644
index 0000000..ddac471
--- /dev/null
+++ b/assets/9b7cc1d2.html-a318771d.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-20253c7f","path":"/8612fa7f/b7e144d1/e85d694a/9b7cc1d2.html","title":"[124]二叉树中的最大路径和","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"二叉树\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1/e85d694a\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/e85d694a/9b7cc1d2.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/e85d694a/9b7cc1d2.html\\",\\"headline\\":\\"[124]二叉树中的最大路径和\\",\\"name\\":\\"[124]二叉树中的最大路径和\\",\\"datePublished\\":\\"2022-07-20\\",\\"dateModified\\":\\"2022-07-20\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/e85d694a/9b7cc1d2.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[124]二叉树中的最大路径和","date":"2022-07-20 09:34:52","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"二叉树","path":"/categories/b7e144d1/e85d694a"}],"tags":[{"name":"二叉树","path":"/tags/e85d694a"}],"abbrlink":"9b7cc1d2","permalink":"/8612fa7f/b7e144d1/e85d694a/9b7cc1d2.html"},"headers":[]}`);export{t as data};
diff --git a/assets/9c47706b.html-232b29cd.js b/assets/9c47706b.html-232b29cd.js
new file mode 100644
index 0000000..6004b09
--- /dev/null
+++ b/assets/9c47706b.html-232b29cd.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-92b3379e","path":"/8612fa7f/47867b98/Java/9c47706b.html","title":"win10下编译以及调试openjdk","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Java/9c47706b.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Java/9c47706b.html\\",\\"headline\\":\\"win10下编译以及调试openjdk\\",\\"name\\":\\"win10下编译以及调试openjdk\\",\\"datePublished\\":\\"2020-12-05\\",\\"dateModified\\":\\"2020-12-05\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Java/9c47706b.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"openjdk\\",\\"dyt\\",\\"dragondyt\\",\\"win10下编译以及调试openjdk\\"]}"]],"title":"win10下编译以及调试openjdk","tags":[{"name":"java","path":"/tags/java"}],"categories":[{"name":"教程","path":"/categories/1868f51e"}],"keywords":["openjdk","dyt","dragondyt","win10下编译以及调试openjdk"],"date":"2020-12-05T17:00:19.000Z","abbrlink":"9c47706b","permalink":"/8612fa7f/47867b98/Java/9c47706b.html"},"headers":[{"level":1,"title":"编译OpenJDK","slug":"编译openjdk","link":"#编译openjdk","children":[{"level":2,"title":"安装编译环境","slug":"安装编译环境","link":"#安装编译环境","children":[]}]},{"level":1,"title":"调试OpenJDK","slug":"调试openjdk","link":"#调试openjdk","children":[{"level":2,"title":"安装clion","slug":"安装clion","link":"#安装clion","children":[]},{"level":2,"title":"配置clion","slug":"配置clion","link":"#配置clion","children":[]},{"level":2,"title":"运行结果","slug":"运行结果","link":"#运行结果","children":[]}]}]}`);export{t as data};
diff --git a/assets/9c47706b.html-89c50918.js b/assets/9c47706b.html-89c50918.js
new file mode 100644
index 0000000..9d86007
--- /dev/null
+++ b/assets/9c47706b.html-89c50918.js
@@ -0,0 +1,23 @@
+import{_ as e,o as t,c as a,e as i}from"./app-5c46a61a.js";const d={},n=i(`
`,44),r=[n];function o(l,s){return t(),a("div",null,r)}const p=e(d,[["render",o],["__file","9c47706b.html.vue"]]);export{p as default};
diff --git a/assets/Comment-1ec3b863.js b/assets/Comment-1ec3b863.js
new file mode 100644
index 0000000..e7a151f
--- /dev/null
+++ b/assets/Comment-1ec3b863.js
@@ -0,0 +1 @@
+import{_ as e,o as c,c as n}from"./app-5c46a61a.js";const o={};function t(r,_){return c(),n("div",null,"评论")}const a=e(o,[["render",t],["__file","Comment.vue"]]);export{a as default};
diff --git a/assets/aa3015f4.html-68b9daa5.js b/assets/aa3015f4.html-68b9daa5.js
new file mode 100644
index 0000000..2495abd
--- /dev/null
+++ b/assets/aa3015f4.html-68b9daa5.js
@@ -0,0 +1,29 @@
+import{_ as e,o as a,c as t,e as r}from"./app-5c46a61a.js";const o={},d=r(`
W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=android, name=id, value=0x100b0001
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=, name=layout, value=0x10030009
+W: Could not decode attr value, using undecoded value instead: ns=, name=style, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=android, name=textAppearance, value=0x100d0058
+W: Could not decode attr value, using undecoded value instead: ns=, name=style, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=android, name=textAppearance, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=android, name=height, value=0x100a0003
+W: Could not decode attr value, using undecoded value instead: ns=android, name=width, value=0x100a0003
+I: Decoding values */* XMLs...
+Can't find framework resources for package of id: 16. You must install proper framework files, see project website for more info.
+
C:\\Users\\dyt\\Desktop\\dex-tools-2.1-SNAPSHOT>d2j-dex2jar.bat classes.dex
+dex2jar classes.dex -> .\\classes-dex2jar.jar
+Detail Error Information in File .\\classes-error.zip
+Please report this file to one of following link if possible (any one).
+ https://sourceforge.net/p/dex2jar/tickets/
+ https://bitbucket.org/pxb1988/dex2jar/issues
+ https://github.com/pxb1988/dex2jar/issues [no attachment support, not preferred]
+ dex2jar@googlegroups.com
+
";if(t)return Promise.resolve(i);if(n){n(null,i);return}return i}if(t)return Promise.reject(r);if(n){n(r);return}throw r}}function Zl(e,t){return(n,r,i)=>{typeof r=="function"&&(i=r,r=null);const s={...r};r={...ee.defaults,...s};const o=Id(r.silent,r.async,i);if(typeof n>"u"||n===null)return o(new Error("marked(): input parameter is undefined or null"));if(typeof n!="string")return o(new Error("marked(): input parameter is of type "+Object.prototype.toString.call(n)+", string expected"));if(Sd(r),r.hooks&&(r.hooks.options=r),i){const l=r.highlight;let a;try{r.hooks&&(n=r.hooks.preprocess(n)),a=e(n,r)}catch(f){return o(f)}const u=function(f){let h;if(!f)try{r.walkTokens&&ee.walkTokens(a,r.walkTokens),h=t(a,r),r.hooks&&(h=r.hooks.postprocess(h))}catch(m){f=m}return r.highlight=l,f?o(f):i(null,h)};if(!l||l.length<3||(delete r.highlight,!a.length))return u();let c=0;ee.walkTokens(a,function(f){f.type==="code"&&(c++,setTimeout(()=>{l(f.text,f.lang,function(h,m){if(h)return u(h);m!=null&&m!==f.text&&(f.text=m,f.escaped=!0),c--,c===0&&u()})},0))}),c===0&&u();return}if(r.async)return Promise.resolve(r.hooks?r.hooks.preprocess(n):n).then(l=>e(l,r)).then(l=>r.walkTokens?Promise.all(ee.walkTokens(l,r.walkTokens)).then(()=>l):l).then(l=>t(l,r)).then(l=>r.hooks?r.hooks.postprocess(l):l).catch(o);try{r.hooks&&(n=r.hooks.preprocess(n));const l=e(n,r);r.walkTokens&&ee.walkTokens(l,r.walkTokens);let a=t(l,r);return r.hooks&&(a=r.hooks.postprocess(a)),a}catch(l){return o(l)}}}function ee(e,t,n){return Zl(Dt.lex,zt.parse)(e,t,n)}ee.options=ee.setOptions=function(e){return ee.defaults={...ee.defaults,...e},Ed(ee.defaults),ee};ee.getDefaults=Ul;ee.defaults=Zt;ee.use=function(...e){const t=ee.defaults.extensions||{renderers:{},childTokens:{}};e.forEach(n=>{const r={...n};if(r.async=ee.defaults.async||r.async||!1,n.extensions&&(n.extensions.forEach(i=>{if(!i.name)throw new Error("extension name required");if(i.renderer){const s=t.renderers[i.name];s?t.renderers[i.name]=function(...o){let l=i.renderer.apply(this,o);return l===!1&&(l=s.apply(this,o)),l}:t.renderers[i.name]=i.renderer}if(i.tokenizer){if(!i.level||i.level!=="block"&&i.level!=="inline")throw new Error("extension level must be 'block' or 'inline'");t[i.level]?t[i.level].unshift(i.tokenizer):t[i.level]=[i.tokenizer],i.start&&(i.level==="block"?t.startBlock?t.startBlock.push(i.start):t.startBlock=[i.start]:i.level==="inline"&&(t.startInline?t.startInline.push(i.start):t.startInline=[i.start]))}i.childTokens&&(t.childTokens[i.name]=i.childTokens)}),r.extensions=t),n.renderer){const i=ee.defaults.renderer||new Yi;for(const s in n.renderer){const o=i[s];i[s]=(...l)=>{let a=n.renderer[s].apply(i,l);return a===!1&&(a=o.apply(i,l)),a}}r.renderer=i}if(n.tokenizer){const i=ee.defaults.tokenizer||new Gi;for(const s in n.tokenizer){const o=i[s];i[s]=(...l)=>{let a=n.tokenizer[s].apply(i,l);return a===!1&&(a=o.apply(i,l)),a}}r.tokenizer=i}if(n.hooks){const i=ee.defaults.hooks||new Sr;for(const s in n.hooks){const o=i[s];Sr.passThroughHooks.has(s)?i[s]=l=>{if(ee.defaults.async)return Promise.resolve(n.hooks[s].call(i,l)).then(u=>o.call(i,u));const a=n.hooks[s].call(i,l);return o.call(i,a)}:i[s]=(...l)=>{let a=n.hooks[s].apply(i,l);return a===!1&&(a=o.apply(i,l)),a}}r.hooks=i}if(n.walkTokens){const i=ee.defaults.walkTokens;r.walkTokens=function(s){let o=[];return o.push(n.walkTokens.call(this,s)),i&&(o=o.concat(i.call(this,s))),o}}ee.setOptions(r)})};ee.walkTokens=function(e,t){let n=[];for(const r of e)switch(n=n.concat(t.call(ee,r)),r.type){case"table":{for(const i of r.header)n=n.concat(ee.walkTokens(i.tokens,t));for(const i of r.rows)for(const s of i)n=n.concat(ee.walkTokens(s.tokens,t));break}case"list":{n=n.concat(ee.walkTokens(r.items,t));break}default:ee.defaults.extensions&&ee.defaults.extensions.childTokens&&ee.defaults.extensions.childTokens[r.type]?ee.defaults.extensions.childTokens[r.type].forEach(function(i){n=n.concat(ee.walkTokens(r[i],t))}):r.tokens&&(n=n.concat(ee.walkTokens(r.tokens,t)))}return n};ee.parseInline=Zl(Dt.lexInline,zt.parseInline);ee.Parser=zt;ee.parser=zt.parse;ee.Renderer=Yi;ee.TextRenderer=Wl;ee.Lexer=Dt;ee.lexer=Dt.lex;ee.Tokenizer=Gi;ee.Slugger=Kl;ee.Hooks=Sr;ee.parse=ee;ee.options;ee.setOptions;ee.use;ee.walkTokens;ee.parseInline;zt.parse;Dt.lex;const Od=["nick","mail","link"],Gs=e=>e.filter(t=>Od.includes(t)),Ys=["//unpkg.com/@waline/emojis@1.1.0/weibo"],Pd="en-US",Dd=["//unpkg.com/@waline/emojis/tieba/tieba_agree.png","//unpkg.com/@waline/emojis/tieba/tieba_look_down.png","//unpkg.com/@waline/emojis/tieba/tieba_sunglasses.png","//unpkg.com/@waline/emojis/tieba/tieba_pick_nose.png","//unpkg.com/@waline/emojis/tieba/tieba_awkward.png","//unpkg.com/@waline/emojis/tieba/tieba_sleep.png"],zd=e=>new Promise((t,n)=>{if(e.size>128e3)return n(new Error("File too large! File size limit 128KB"));const r=new FileReader;r.readAsDataURL(e),r.onload=()=>{var i;return t(((i=r.result)==null?void 0:i.toString())||"")},r.onerror=n}),Fd=e=>e===!0?'
`,36),r=[i];function d(s,u){return n(),o("div",null,r)}const l=t(a,[["render",d],["__file","c4877271.html.vue"]]);export{l as default};
diff --git a/assets/c4877271.html-7c746610.js b/assets/c4877271.html-7c746610.js
new file mode 100644
index 0000000..46e0805
--- /dev/null
+++ b/assets/c4877271.html-7c746610.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-867195e6","path":"/8612fa7f/e00fc567/5ac6f809/c4877271.html","title":"Failed to resolve: androidx.appcompat:appcompat:1.1.0","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"踩坑\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7cf68d8\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"安卓\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7cf68d8/e00fc567\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/5ac6f809/c4877271.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/5ac6f809/c4877271.html\\",\\"headline\\":\\"Failed to resolve: androidx.appcompat:appcompat:1.1.0\\",\\"name\\":\\"Failed to resolve: androidx.appcompat:appcompat:1.1.0\\",\\"datePublished\\":\\"2020-05-09\\",\\"dateModified\\":\\"2020-05-09\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/5ac6f809/c4877271.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"Failed to resolve: androidx.appcompat:appcompat:1.1.0\\"]}"]],"title":"Failed to resolve: androidx.appcompat:appcompat:1.1.0","tags":[{"name":"安卓","path":"/tags/e00fc567"},{"name":"吐槽","path":"/tags/62f4a42b"}],"categories":[{"name":"踩坑","path":"/categories/b7cf68d8"},{"name":"安卓","path":"/categories/b7cf68d8/e00fc567"}],"keywords":["Failed to resolve: androidx.appcompat:appcompat:1.1.0"],"date":"2020-05-09T10:54:35.000Z","abbrlink":"c4877271","permalink":"/8612fa7f/e00fc567/5ac6f809/c4877271.html"},"headers":[{"level":2,"title":"安卓实验–内容提供器","slug":"安卓实验–内容提供器","link":"#安卓实验–内容提供器","children":[]}]}`);export{t as data};
diff --git a/assets/c7081503.html-4ba99b2c.js b/assets/c7081503.html-4ba99b2c.js
new file mode 100644
index 0000000..4f3046a
--- /dev/null
+++ b/assets/c7081503.html-4ba99b2c.js
@@ -0,0 +1,70 @@
+import{_ as r,o as n,c as t,a as e}from"./app-5c46a61a.js";const i={},o=e("pre",null,[e("code",{class:"language-java"},`/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ * int val;
+ * TreeNode left;
+ * TreeNode right;
+ * TreeNode() {}
+ * TreeNode(int val) { this.val = val; }
+ * TreeNode(int val, TreeNode left, TreeNode right) {
+ * this.val = val;
+ * this.left = left;
+ * this.right = right;
+ * }
+ * }
+ */
+class Solution {
+ public TreeNode buildTree(int[] preorder, int[] inorder) {
+ return buildTree(preorder, inorder, 0, preorder.length - 1, 0, inorder.length - 1);
+ }
+
+ private TreeNode buildTree(int[] preorder, int[] inorder, int preStart, int preEnd, int inStart, int inEnd) {
+ if (preStart > preEnd) {
+ return null;
+ } //根的值
+ int rootVal = preorder[preStart];
+ //中序中根的位置
+ int index = 0;
+ for (int i = inStart; i <= inEnd; i++) {
+ if (inorder[i] == rootVal) {
+ index = i;
+ break;
+ }
+ }
+ //根节点左边节点数
+ int leftSize = index - inStart;
+ TreeNode root = new TreeNode(rootVal);
+ //[ 根节点, [左子树的前序遍历结果], [右子树的前序遍历结果] ]
+ //[ [左子树的中序遍历结果], 根节点, [右子树的中序遍历结果] ]
+ root.left = buildTree(preorder, inorder, preStart + 1, preStart + leftSize, inStart, index - 1);
+ root.right = buildTree(preorder, inorder, preStart + 1 + leftSize, preEnd, index + 1, inEnd);
+ return root;
+ }
+}
+`)],-1),d=e("p",null,"改进",-1),l=e("pre",null,[e("code",{class:"language-java"},`class Solution {
+ Map valOrderMap = new HashMap<>();
+ public TreeNode buildTree(int[] preorder, int[] inorder) {
+ for (int j = 0; j < inorder.length; j++) {
+ valOrderMap.put(inorder[j],j);
+ }
+ return buildTree(preorder, inorder, 0, preorder.length - 1, 0, inorder.length - 1);
+ }
+
+ private TreeNode buildTree(int[] preorder, int[] inorder, int preStart, int preEnd, int inStart, int inEnd) {
+ if (preStart > preEnd) {
+ return null;
+ } //根的值
+ int rootVal = preorder[preStart];
+ //中序中根的位置
+ int index = valOrderMap.get(rootVal);
+ //根节点左边节点数
+ int leftSize = index - inStart;
+ TreeNode root = new TreeNode(rootVal);
+ //[ 根节点, [左子树的前序遍历结果], [右子树的前序遍历结果] ]
+ //[ [左子树的中序遍历结果], 根节点, [右子树的中序遍历结果] ]
+ root.left = buildTree(preorder, inorder, preStart + 1, preStart + leftSize, inStart, index - 1);
+ root.right = buildTree(preorder, inorder, preStart + 1 + leftSize, preEnd, index + 1, inEnd);
+ return root;
+ }
+}
+`)],-1),a=[o,d,l];function p(s,u){return n(),t("div",null,a)}const S=r(i,[["render",p],["__file","c7081503.html.vue"]]);export{S as default};
diff --git a/assets/c7081503.html-a2524c58.js b/assets/c7081503.html-a2524c58.js
new file mode 100644
index 0000000..8ca4957
--- /dev/null
+++ b/assets/c7081503.html-a2524c58.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-6d631026","path":"/8612fa7f/b7e144d1/e85d694a/c7081503.html","title":"[105]从前序与中序遍历序列构造二叉树","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"算法\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"二叉树\\",\\"item\\":\\"https://blog.dragondyt.top/categories/b7e144d1/e85d694a\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/e85d694a/c7081503.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/e85d694a/c7081503.html\\",\\"headline\\":\\"[105]从前序与中序遍历序列构造二叉树\\",\\"name\\":\\"[105]从前序与中序遍历序列构造二叉树\\",\\"datePublished\\":\\"2022-07-20\\",\\"dateModified\\":\\"2022-07-20\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/b7e144d1/e85d694a/c7081503.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"[105]从前序与中序遍历序列构造二叉树","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"算法","path":"/categories/b7e144d1"},{"name":"二叉树","path":"/categories/b7e144d1/e85d694a"}],"tags":[{"name":"二叉树","path":"/tags/e85d694a"}],"date":"2022-07-20 12:40:11","abbrlink":"c7081503","permalink":"/8612fa7f/b7e144d1/e85d694a/c7081503.html"},"headers":[]}`);export{t as data};
diff --git a/assets/c82dcf86.html-dbd354ab.js b/assets/c82dcf86.html-dbd354ab.js
new file mode 100644
index 0000000..06adf66
--- /dev/null
+++ b/assets/c82dcf86.html-dbd354ab.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-4f301c8a","path":"/8612fa7f/47867b98/Java/c82dcf86.html","title":"使用yandex邮箱 ,报错Got bad greeting from SMTP host: smtp.yandex.com, port: 465, response: [EOF]","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Java/c82dcf86.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Java/c82dcf86.html\\",\\"headline\\":\\"使用yandex邮箱 ,报错Got bad greeting from SMTP host: smtp.yandex.com, port: 465, response: [EOF]\\",\\"name\\":\\"使用yandex邮箱 ,报错Got bad greeting from SMTP host: smtp.yandex.com, port: 465, response: [EOF]\\",\\"datePublished\\":\\"2020-07-29\\",\\"dateModified\\":\\"2020-07-29\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Java/c82dcf86.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"java\\",\\"springboot\\",\\"mail\\"]}"]],"title":"使用yandex邮箱 ,报错Got bad greeting from SMTP host: smtp.yandex.com, port: 465, response: [EOF]","tags":[{"name":"踩坑","path":"/tags/b7cf68d8"},{"name":"java","path":"/tags/java"}],"categories":[{"name":"Springboot","path":"/categories/Springboot"}],"keywords":["java","springboot","mail"],"date":"2020-07-29T21:54:35.000Z","abbrlink":"c82dcf86","permalink":"/8612fa7f/47867b98/Java/c82dcf86.html"},"headers":[{"level":2,"title":"前言","slug":"前言","link":"#前言","children":[]}]}`);export{t as data};
diff --git a/assets/c82dcf86.html-dee9609e.js b/assets/c82dcf86.html-dee9609e.js
new file mode 100644
index 0000000..ef952a6
--- /dev/null
+++ b/assets/c82dcf86.html-dee9609e.js
@@ -0,0 +1,210 @@
+import{_ as e,o as n,c as a,e as t}from"./app-5c46a61a.js";const r={},i=t(`
IMAP(Internet Mail Access Protocol)以前称作交互邮件访问协议(Interactive Mail Access Protocol),是一个应用层协议。IMAP是斯坦福大学在1986年开发的一种邮件获取协议。它的主要作用是邮件客户端可以通过这种协议从邮件服务器上获取邮件的信息,下载邮件等。当前的权威定义是RFC3501。IMAP协议运行在TCP/IP协议之上,使用的端口是143。它与POP3协议的主要区别是用户可以不用把所有的邮件全部下载,可以通过客户端直接对服务器上的邮件进行操作,提供了SSL加密的IMAP协议被称为IMAP S,POP3 默认端口143,POP3S默认端口993。
`,37),s=[i];function o(d,l){return n(),a("div",null,s)}const m=e(r,[["render",o],["__file","c82dcf86.html.vue"]]);export{m as default};
diff --git a/assets/d30922d5.html-43b5d096.js b/assets/d30922d5.html-43b5d096.js
new file mode 100644
index 0000000..18cbea8
--- /dev/null
+++ b/assets/d30922d5.html-43b5d096.js
@@ -0,0 +1,103 @@
+import{_ as o,r as d,o as l,c as s,a as r,b as e,d as n,w as a,e as i}from"./app-5c46a61a.js";const c={},u=r("br",null,null,-1),h=r("strong",null,"💌依赖插件",-1),m=r("br",null,null,-1),p=i(`
`,22);function g(f,k){const t=d("RouterLink");return l(),s("div",null,[r("p",null,[e(":::primary"),u,n(t,{to:"/computer-science/note/theme-shoka-doc/"},{default:a(()=>[e("🚀快速开始")]),_:1}),e(" - "),n(t,{to:"/computer-science/note/theme-shoka-doc/dependents/"},{default:a(()=>[h]),_:1}),e(" - "),n(t,{to:"/computer-science/note/theme-shoka-doc/config/"},{default:a(()=>[e("📌基本配置")]),_:1}),e(" - "),n(t,{to:"/computer-science/note/theme-shoka-doc/display/"},{default:a(()=>[e("🌈界面显示")]),_:1}),e(" - "),n(t,{to:"/computer-science/note/theme-shoka-doc/special/"},{default:a(()=>[e("🦄特殊功能")]),_:1}),m,e(" :::")]),p])}const x=o(c,[["render",g],["__file","d30922d5.html.vue"]]);export{x as default};
diff --git a/assets/d30922d5.html-c9d774a1.js b/assets/d30922d5.html-c9d774a1.js
new file mode 100644
index 0000000..4bf344b
--- /dev/null
+++ b/assets/d30922d5.html-c9d774a1.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-24188f82","path":"/computer-science/note/theme-shoka-doc/d30922d5.html","title":"Step.1 依赖插件","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"BreadcrumbList\\",\\"itemListElement\\":[{\\"@type\\":\\"ListItem\\",\\"position\\":0,\\"name\\":\\"计算机科学\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":1,\\"name\\":\\"二进制杂谈\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622/97a3d3dd\\"},{\\"@type\\":\\"ListItem\\",\\"position\\":2,\\"name\\":\\"Theme Shoka Documentation\\",\\"item\\":\\"https://blog.dragondyt.top/categories/11159622/97a3d3dd/Theme-Shoka-Documentation\\"}]}"],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/computer-science/note/theme-shoka-doc/d30922d5.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/computer-science/note/theme-shoka-doc/d30922d5.html\\",\\"headline\\":\\"Step.1 依赖插件\\",\\"name\\":\\"Step.1 依赖插件\\",\\"datePublished\\":\\"2020-08-13\\",\\"dateModified\\":\\"2020-08-13\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/computer-science/note/theme-shoka-doc/d30922d5.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"Step.1 依赖插件","date":"2020-08-13T20:46:48.000Z","categories":[{"name":"计算机科学","path":"/categories/11159622"},{"name":"二进制杂谈","path":"/categories/11159622/97a3d3dd"},{"name":"Theme Shoka Documentation","path":"/categories/11159622/97a3d3dd/Theme-Shoka-Documentation"}],"tags":[{"name":"Hexo","path":"/tags/Hexo"},{"name":"教程","path":"/tags/1868f51e"}],"valine":{"placeholder":"1. 提问前请先仔细阅读本文档⚡\\n2. 页面显示问题💥,请提供控制台截图📸或者您的测试网址\\n3. 其他任何报错💣,请提供详细描述和截图📸,祝食用愉快💪"},"permalink":"/computer-science/note/theme-shoka-doc/d30922d5.html","abbrlink":"d30922d5"},"headers":[{"level":1,"title":"multi-markdown-it安装与配置","slug":"multi-markdown-it安装与配置","link":"#multi-markdown-it安装与配置","children":[{"level":2,"title":"安装","slug":"安装","link":"#安装","children":[]},{"level":2,"title":"配置","slug":"配置","link":"#配置","children":[]}]},{"level":1,"title":"autoprefixer配置建议","slug":"autoprefixer配置建议","link":"#autoprefixer配置建议","children":[]},{"level":1,"title":"algolia配置建议","slug":"algolia配置建议","link":"#algolia配置建议","children":[]},{"level":1,"title":"feed配置建议","slug":"feed配置建议","link":"#feed配置建议","children":[]}]}`);export{t as data};
diff --git a/assets/ecdcd4fc.html-b800b5f4.js b/assets/ecdcd4fc.html-b800b5f4.js
new file mode 100644
index 0000000..e365ecb
--- /dev/null
+++ b/assets/ecdcd4fc.html-b800b5f4.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-6c92eadd","path":"/8612fa7f/e00fc567/OpenGL/ecdcd4fc.html","title":"OpenGL环境测试","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/OpenGL/ecdcd4fc.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/OpenGL/ecdcd4fc.html\\",\\"headline\\":\\"OpenGL环境测试\\",\\"name\\":\\"OpenGL环境测试\\",\\"datePublished\\":\\"0000-00-00\\",\\"dateModified\\":\\"0000-00-00\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/OpenGL/ecdcd4fc.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\"}"]],"title":"OpenGL环境测试","tags":[{"name":"OpenGL","path":"/tags/OpenGL"},{"name":"NDK","path":"/tags/NDK"}],"abbrlink":"ecdcd4fc","permalink":"/8612fa7f/e00fc567/OpenGL/ecdcd4fc.html","categories":[]},"headers":[]}`);export{t as data};
diff --git a/assets/ecdcd4fc.html-e0d6f233.js b/assets/ecdcd4fc.html-e0d6f233.js
new file mode 100644
index 0000000..07b723d
--- /dev/null
+++ b/assets/ecdcd4fc.html-e0d6f233.js
@@ -0,0 +1,12 @@
+import{_ as a,o as n,c as o,a as e}from"./app-5c46a61a.js";const t={},r=e("p",null,"日志",-1),c=e("pre",null,[e("code",null,`2022-09-27 13:55:55.593 6546-6601/com.example.opengl E/EGL_emulation: eglCreateContext: EGL_BAD_CONFIG: no ES 3 support
+2022-09-27 13:55:55.593 6546-6601/com.example.opengl E/EGL_emulation: tid 6601: eglCreateContext(1682): error 0x3005 (EGL_BAD_CONFIG)
+2022-09-27 13:55:55.593 6546-6601/com.example.opengl E/AndroidRuntime: FATAL EXCEPTION: GLThread 501
+ Process: com.example.opengl, PID: 6546
+ java.lang.RuntimeException: createContext failed: EGL_BAD_CONFIG
+ at android.opengl.GLSurfaceView$EglHelper.throwEglException(GLSurfaceView.java:1223)
+ at android.opengl.GLSurfaceView$EglHelper.throwEglException(GLSurfaceView.java:1214)
+ at android.opengl.GLSurfaceView$EglHelper.start(GLSurfaceView.java:1064)
+ at android.opengl.GLSurfaceView$GLThread.guardedRun(GLSurfaceView.java:1431)
+ at android.opengl.GLSurfaceView$GLThread.run(GLSurfaceView.java:1272)
+
+`)],-1),l=e("p",null,"估计是电脑没显卡导致的",-1),i=[r,c,l];function d(p,_){return n(),o("div",null,i)}const s=a(t,[["render",d],["__file","ecdcd4fc.html.vue"]]);export{s as default};
diff --git a/assets/fd72446f.html-7d3620fb.js b/assets/fd72446f.html-7d3620fb.js
new file mode 100644
index 0000000..66fd4d5
--- /dev/null
+++ b/assets/fd72446f.html-7d3620fb.js
@@ -0,0 +1,8 @@
+import{_ as e,o as t,c as a,e as o}from"./app-5c46a61a.js";const c={},n=o(`
`,7),r=[n];function s(d,p){return t(),a("div",null,r)}const l=e(c,[["render",s],["__file","fd72446f.html.vue"]]);export{l as default};
diff --git a/assets/fd72446f.html-e11f2d19.js b/assets/fd72446f.html-e11f2d19.js
new file mode 100644
index 0000000..b31277b
--- /dev/null
+++ b/assets/fd72446f.html-e11f2d19.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-e3ac4c4c","path":"/8612fa7f/47867b98/Java/fd72446f.html","title":"gateway配合nacos SERVICE_UNAVAILABLE “Unable to find instance for xxx","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Java/fd72446f.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Java/fd72446f.html\\",\\"headline\\":\\"gateway配合nacos SERVICE_UNAVAILABLE “Unable to find instance for xxx\\",\\"name\\":\\"gateway配合nacos SERVICE_UNAVAILABLE “Unable to find instance for xxx\\",\\"datePublished\\":\\"2021-05-14\\",\\"dateModified\\":\\"2021-05-14\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/47867b98/Java/fd72446f.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"nacos1.4.1\\",\\"gateway3.0.2\\",\\"springcloud2020\\"]}"]],"title":"gateway配合nacos SERVICE_UNAVAILABLE “Unable to find instance for xxx","tags":[{"name":"java","path":"/tags/java"},{"name":"微服务","path":"/tags/460c1130"}],"categories":[{"name":"java","path":"/categories/java"}],"keywords":["nacos1.4.1","gateway3.0.2","springcloud2020"],"date":"2021-05-14T17:34:35.000Z","abbrlink":"fd72446f","permalink":"/8612fa7f/47867b98/Java/fd72446f.html"},"headers":[{"level":1,"title":"gateway配合nacos 找不到服务的问题","slug":"gateway配合nacos-找不到服务的问题","link":"#gateway配合nacos-找不到服务的问题","children":[]}]}`);export{t as data};
diff --git a/assets/ff03d5f4.html-14cacdf5.js b/assets/ff03d5f4.html-14cacdf5.js
new file mode 100644
index 0000000..acbadec
--- /dev/null
+++ b/assets/ff03d5f4.html-14cacdf5.js
@@ -0,0 +1 @@
+const t=JSON.parse(`{"key":"v-d874a1a0","path":"/8612fa7f/e00fc567/5ac6f809/ff03d5f4.html","title":"安卓开发学习--安装开发环境","lang":"en-US","frontmatter":{"head":[["link",{"rel":"alternate","type":"application/rss+xml","href":"https://blog.dragondyt.top/rss.xml","title":"RSS"}],["link",{"rel":"alternate","type":"application/json","href":"https://blog.dragondyt.top/feed.json","title":"RSS"}],["link",{"rel":"alternate","type":"application/atom+xml","href":"https://blog.dragondyt.top/atom.xml","title":"RSS"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org/\\",\\"@type\\":\\"BlogPosting\\",\\"@id\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/5ac6f809/ff03d5f4.html\\",\\"mainEntityOfPage\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/5ac6f809/ff03d5f4.html\\",\\"headline\\":\\"安卓开发学习--安装开发环境\\",\\"name\\":\\"安卓开发学习--安装开发环境\\",\\"datePublished\\":\\"2020-03-05\\",\\"dateModified\\":\\"2020-03-05\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"@id\\":\\"https://dataliberate.com/author/richard-wallis/#Person\\",\\"name\\":\\"Richard Wallis\\",\\"url\\":\\"https://dataliberate.com/author/richard-wallis/\\",\\"image\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"url\\":\\"https://secure.gravatar.com/avatar/bbdd78abba6116d6f5bfa2c992de6592?s=96&d=mm&r=g\\",\\"height\\":\\"96\\",\\"width\\":\\"96\\"}},\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"Data Liberate\\",\\"logo\\":{\\"@type\\":\\"ImageObject\\",\\"@id\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"url\\":\\"https://dataliberate.com/wp-content/uploads/2011/12/Data_Liberate_Logo-200.png\\",\\"width\\":\\"600\\",\\"height\\":\\"60\\"}},\\"url\\":\\"https://blog.dragondyt.top/8612fa7f/e00fc567/5ac6f809/ff03d5f4.html\\",\\"isPartOf\\":{\\"@type\\":\\"Blog\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\",\\"publisher\\":{\\"@type\\":\\"Organization\\",\\"@id\\":\\"https://blog.dragondyt.top\\",\\"name\\":\\"\\"}},\\"commentCount\\":\\"1\\",\\"comment\\":[{\\"@type\\":\\"Comment\\",\\"@id\\":\\"https://dataliberate.com/2019/05/14/library-metadata-evolution-final-mile/#Comment1\\",\\"dateCreated\\":\\"2019-06-23 17:31:15\\",\\"description\\":\\"I've been looking for a decent metadata scheme for use in a home-brew library system for the past 4 years now. I'm a big user of schema.org. I found this very interesting, especially the part about reconciliation. I assume you're referring to the process of identifying duplicate representations of works. This has also been one of my biggest struggles. I'll still be waiting for schema.org to mature...\\",\\"author\\":{\\"@type\\":\\"Person\\",\\"name\\":\\"Jeff\\",\\"url\\":\\"http://schoenstatt.link\\"}}],\\"about\\":[{\\"@type\\":\\"Thing\\",\\"@id\\":\\"https://dataliberate.com/category/bibframe/\\",\\"name\\":\\"Bibframe\\",\\"sameAs\\":[\\"https://en.wikipedia.org/wiki/BIBFRAME\\",\\"http://www.wikidata.org/entity/Q17050075\\"]},\\"Data Liberate\\"],\\"wordCount\\":\\"488\\",\\"keywords\\":[\\"安卓\\",\\"java\\",\\"dyt\\",\\"dragondyt\\"]}"]],"title":"安卓开发学习--安装开发环境","tags":[{"name":"安卓","path":"/tags/e00fc567"}],"categories":[{"name":"安卓开发学习","path":"/categories/77ffff1"}],"keywords":["安卓","java","dyt","dragondyt"],"date":"2020-03-05T07:55:57.000Z","abbrlink":"ff03d5f4","permalink":"/8612fa7f/e00fc567/5ac6f809/ff03d5f4.html"},"headers":[{"level":2,"title":"Android Stdio下载","slug":"android-stdio下载","link":"#android-stdio下载","children":[]},{"level":2,"title":"安装过程","slug":"安装过程","link":"#安装过程","children":[]},{"level":2,"title":"App运行方式","slug":"app运行方式","link":"#app运行方式","children":[]}]}`);export{t as data};
diff --git a/assets/ff03d5f4.html-ef849882.js b/assets/ff03d5f4.html-ef849882.js
new file mode 100644
index 0000000..f07600a
--- /dev/null
+++ b/assets/ff03d5f4.html-ef849882.js
@@ -0,0 +1 @@
+import{_ as t,o as e,c as r,e as a}from"./app-5c46a61a.js";const n={},i=a('
',16),o=[i];function s(l,d){return e(),r("div",null,o)}const h=t(n,[["render",s],["__file","ff03d5f4.html.vue"]]);export{h as default};
diff --git a/assets/git.html-97b723df.js b/assets/git.html-97b723df.js
new file mode 100644
index 0000000..5739785
--- /dev/null
+++ b/assets/git.html-97b723df.js
@@ -0,0 +1,7 @@
+import{_ as e,o as t,c as r,e as s}from"./app-5c46a61a.js";const a={},p=s(`
# git push时出现error: src refspec master does not match any解决办法.
font:
+ enable: true
+ # Font options:
+ # `external: true` will load this font family from `host` above.
+ # `family: Times New Roman`. Without any quotes.
+ # `size: x.x`. Use `em` as unit. Default: 1 (16px)
+
+ # Global font settings used for all elements inside <body>.
+ global:
+ external: true
+ family: Mulish
+ size:
+
+ # Font settings for alternate title.
+ logo:
+ external: true
+ family: Fredericka the Great
+ size: 3.5
+
+ # Font settings for site title.
+ title:
+ external: true
+ family: Noto Serif JP
+ size: 2.5
+
+ # Font settings for headlines (<h1> to <h6>).
+ headings:
+ external: true
+ family: Noto Serif SC
+ size:
+
+ # Font settings for posts.
+ posts:
+ external: true
+ family:
+
+ # Font settings for <code> and code blocks.
+ codes:
+ external: true
+ family: Inconsolata
+
IMAP(Internet Mail Access Protocol)以前称作交互邮件访问协议(Interactive Mail Access Protocol),是一个应用层协议。IMAP是斯坦福大学在1986年开发的一种邮件获取协议。它的主要作用是邮件客户端可以通过这种协议从邮件服务器上获取邮件的信息,下载邮件等。当前的权威定义是RFC3501。IMAP协议运行在TCP/IP协议之上,使用的端口是143。它与POP3协议的主要区别是用户可以不用把所有的邮件全部下载,可以通过客户端直接对服务器上的邮件进行操作,提供了SSL加密的IMAP协议被称为IMAP S,POP3 默认端口143,POP3S默认端口993。
W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=android, name=id, value=0x100b0001
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=, name=layout, value=0x10030009
+W: Could not decode attr value, using undecoded value instead: ns=, name=style, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=android, name=textAppearance, value=0x100d0058
+W: Could not decode attr value, using undecoded value instead: ns=, name=style, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=android, name=textAppearance, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=android, name=height, value=0x100a0003
+W: Could not decode attr value, using undecoded value instead: ns=android, name=width, value=0x100a0003
+I: Decoding values */* XMLs...
+Can't find framework resources for package of id: 16. You must install proper framework files, see project website for more info.
+
C:\Users\dyt\Desktop\dex-tools-2.1-SNAPSHOT>d2j-dex2jar.bat classes.dex
+dex2jar classes.dex -> .\classes-dex2jar.jar
+Detail Error Information in File .\classes-error.zip
+Please report this file to one of following link if possible (any one).
+ https://sourceforge.net/p/dex2jar/tickets/
+ https://bitbucket.org/pxb1988/dex2jar/issues
+ https://github.com/pxb1988/dex2jar/issues [no attachment support, not preferred]
+ dex2jar@googlegroups.com
+
数据通信的任务是传输( D )代码的比特序列。
+A. 十进制 B. 帧结构 C. 分组结构 D. 二进制
+
( B )信号的电平是连续变化的。
+A. 数字 B. 模拟 C. 脉冲 D. 二进制
+
( C)是指将数字信号转变成可以在电话线上传输的模拟信号的过程。
+A. 解调 B. 采样 C. 调制 D. 压缩
+
数据传输速率是指每秒钟传输构成数据二进制代码的(D )数。
+A. 码元 B. 信元 C. 波特 D. 位
+
利用模拟通信信道传输数据信号的方法称为( A )。
+A. 频带传输 B. 基带传输 C. 异步传输 D. 同步传输
+
基带传输是指在数字通信信道上( C )传输数字数据信号的方法。
+A. 调制 B. 脉冲编码 C. 直接 D. 间接
+
数据在通信信道传输的过程中,对数据传输的误码率影响最主要的因素是( D )。
+A. 传输速率 B. 调制解调器 C. 传输介质 D. 噪声强度
+9.Internet上的数据交换采用的是( A )。
+A. 分组交换 B. 电路交换 C. 报文交换 D. 光交换
+
FDM是指( A )。
+A. 频分多路复用 B. 时分多路复用 C. 波分多路复用 D. 码分多路利用
+
利用( A ),数字数据可以用模拟信号来表示。
+A. 调制解调器 B. 编码解码器 C. 串联放大器 D. 电话网络
+
在数据通信系统中,传输介质的功能是( D )。
+A. 在信源与信宿之间传输信息 B.纠正传输过程中的错误
+C. 根据环境状况自动调整信号形式 D. 将信号从一端传至另一端
+
在光纤中采用的多路复用技术是( C )。
+A. 时分多路复用 B. 频分多路复用 C. 波分多路复用 D. 码分多路复用
+
为了实现长距离传输,模拟传输系统都使用放大器来使信号中的能量得到增加,其噪声分量( A )。
+A. 增大 B. 减小 C. 不变 D. 不一定
+
“复用”是一种将若干个彼此独立的信号合并为一个可在同一信道上传输的( C )。
+A. 调制信号 B. 已调信号 C. 复用信号 D. 单边带信号
+
物理层4个重要特性:机械特性、功能特性、电气特性和(A)。
+A. 规程特性 B. 接口特性 C.协议特性 D. 物理特性
+17. 基带系统使用(C)进行传输的。
+A. 模拟信号 B. 调制信号 C. 数字信号 D. 载波信号
+18. 下列关于异步传输说法正确的是(D)。
+A. 一次传输一个数据块 B. 对时序的要求较高
+C. 收/发端不需要进行同步 D. 数据传输速率低
+19. 低通通道带宽为5KHz,编码采用512级分级信号,最大数据传输率(D)。
+A. 32 kbps B. 48 kbps C. 64 kbps D. 90 kbps
font:
+ enable: true
+ # Font options:
+ # `external: true` will load this font family from `host` above.
+ # `family: Times New Roman`. Without any quotes.
+ # `size: x.x`. Use `em` as unit. Default: 1 (16px)
+
+ # Global font settings used for all elements inside <body>.
+ global:
+ external: true
+ family: Mulish
+ size:
+
+ # Font settings for alternate title.
+ logo:
+ external: true
+ family: Fredericka the Great
+ size: 3.5
+
+ # Font settings for site title.
+ title:
+ external: true
+ family: Noto Serif JP
+ size: 2.5
+
+ # Font settings for headlines (<h1> to <h6>).
+ headings:
+ external: true
+ family: Noto Serif SC
+ size:
+
+ # Font settings for posts.
+ posts:
+ external: true
+ family:
+
+ # Font settings for <code> and code blocks.
+ codes:
+ external: true
+ family: Inconsolata
+
class Solution {\n public int timeRequiredToBuy(int[] tickets, int k) {\n int ret = 0;\n for (int i = 0; i < tickets.length; i++) {\n if (i <= k) {\n ret = ret + Math.min(tickets[i], tickets[k]);\n } else {\n ret = ret + Math.min(tickets[i], tickets[k] - 1);\n }\n }\n return ret;\n }\n}\n
font:\n enable: true\n # Font options:\n # `external: true` will load this font family from `host` above.\n # `family: Times New Roman`. Without any quotes.\n # `size: x.x`. Use `em` as unit. Default: 1 (16px)\n\n # Global font settings used for all elements inside <body>.\n global:\n external: true\n family: Mulish\n size:\n\n # Font settings for alternate title.\n logo:\n external: true\n family: Fredericka the Great\n size: 3.5\n\n # Font settings for site title.\n title:\n external: true\n family: Noto Serif JP\n size: 2.5\n\n # Font settings for headlines (<h1> to <h6>).\n headings:\n external: true\n family: Noto Serif SC\n size:\n\n # Font settings for posts.\n posts:\n external: true\n family:\n\n # Font settings for <code> and code blocks.\n codes:\n external: true\n family: Inconsolata\n
IMAP(Internet Mail Access Protocol)以前称作交互邮件访问协议(Interactive Mail Access Protocol),是一个应用层协议。IMAP是斯坦福大学在1986年开发的一种邮件获取协议。它的主要作用是邮件客户端可以通过这种协议从邮件服务器上获取邮件的信息,下载邮件等。当前的权威定义是RFC3501。IMAP协议运行在TCP/IP协议之上,使用的端口是143。它与POP3协议的主要区别是用户可以不用把所有的邮件全部下载,可以通过客户端直接对服务器上的邮件进行操作,提供了SSL加密的IMAP协议被称为IMAP S,POP3 默认端口143,POP3S默认端口993。
W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e\nW: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e\nW: Could not decode attr value, using undecoded value instead: ns=android, name=id, value=0x100b0001\nW: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e\nW: Could not decode attr value, using undecoded value instead: ns=, name=layout, value=0x10030009\nW: Could not decode attr value, using undecoded value instead: ns=, name=style, value=0x100d008f\nW: Could not decode attr value, using undecoded value instead: ns=android, name=textAppearance, value=0x100d0058\nW: Could not decode attr value, using undecoded value instead: ns=, name=style, value=0x100d008f\nW: Could not decode attr value, using undecoded value instead: ns=android, name=textAppearance, value=0x100d008f\nW: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e\nW: Could not decode attr value, using undecoded value instead: ns=android, name=height, value=0x100a0003\nW: Could not decode attr value, using undecoded value instead: ns=android, name=width, value=0x100a0003\nI: Decoding values */* XMLs...\nCan't find framework resources for package of id: 16. You must install proper framework files, see project website for more info.\n
C:\\Users\\dyt\\Desktop\\dex-tools-2.1-SNAPSHOT>d2j-dex2jar.bat classes.dex\ndex2jar classes.dex -> .\\classes-dex2jar.jar\nDetail Error Information in File .\\classes-error.zip\nPlease report this file to one of following link if possible (any one).\n https://sourceforge.net/p/dex2jar/tickets/\n https://bitbucket.org/pxb1988/dex2jar/issues\n https://github.com/pxb1988/dex2jar/issues [no attachment support, not preferred]\n dex2jar@googlegroups.com\n
ERROR: Failed to resolve: androidx.appcompat:appcompat:1.1.0\nERROR: Failed to resolve: androidx.test.ext:junit:1.1.1\nERROR: Failed to resolve: androidx.test.espresso:espresso-core:3.2.0\nERROR: Failed to resolve: androidx.constraintlayout:constraintlayout:1.1.3\n
数据通信的任务是传输( D )代码的比特序列。 \nA. 十进制 B. 帧结构 C. 分组结构 D. 二进制
\n
( B )信号的电平是连续变化的。 \nA. 数字 B. 模拟 C. 脉冲 D. 二进制
\n
( C)是指将数字信号转变成可以在电话线上传输的模拟信号的过程。 \nA. 解调 B. 采样 C. 调制 D. 压缩
\n
数据传输速率是指每秒钟传输构成数据二进制代码的(D )数。 \nA. 码元 B. 信元 C. 波特 D. 位
\n
利用模拟通信信道传输数据信号的方法称为( A )。 \nA. 频带传输 B. 基带传输 C. 异步传输 D. 同步传输
\n
基带传输是指在数字通信信道上( C )传输数字数据信号的方法。 \nA. 调制 B. 脉冲编码 C. 直接 D. 间接
\n
数据在通信信道传输的过程中,对数据传输的误码率影响最主要的因素是( D )。 \nA. 传输速率 B. 调制解调器 C. 传输介质 D. 噪声强度 \n9.Internet上的数据交换采用的是( A )。 \nA. 分组交换 B. 电路交换 C. 报文交换 D. 光交换
\n
FDM是指( A )。 \nA. 频分多路复用 B. 时分多路复用 C. 波分多路复用 D. 码分多路利用
\n
利用( A ),数字数据可以用模拟信号来表示。 \nA. 调制解调器 B. 编码解码器 C. 串联放大器 D. 电话网络
\n
在数据通信系统中,传输介质的功能是( D )。 \nA. 在信源与信宿之间传输信息 B.纠正传输过程中的错误 \nC. 根据环境状况自动调整信号形式 D. 将信号从一端传至另一端
\n
在光纤中采用的多路复用技术是( C )。 \nA. 时分多路复用 B. 频分多路复用 C. 波分多路复用 D. 码分多路复用
\n
为了实现长距离传输,模拟传输系统都使用放大器来使信号中的能量得到增加,其噪声分量( A )。 \nA. 增大 B. 减小 C. 不变 D. 不一定
\n
“复用”是一种将若干个彼此独立的信号合并为一个可在同一信道上传输的( C )。 \nA. 调制信号 B. 已调信号 C. 复用信号 D. 单边带信号
\n
物理层4个重要特性:机械特性、功能特性、电气特性和(A)。 \nA. 规程特性 B. 接口特性 C.协议特性 D. 物理特性 \n17. 基带系统使用(C)进行传输的。 \nA. 模拟信号 B. 调制信号 C. 数字信号 D. 载波信号 \n18. 下列关于异步传输说法正确的是(D)。 \nA. 一次传输一个数据块 B. 对时序的要求较高 \nC. 收/发端不需要进行同步 D. 数据传输速率低 \n19. 低通通道带宽为5KHz,编码采用512级分级信号,最大数据传输率(D)。 \nA. 32 kbps B. 48 kbps C. 64 kbps D. 90 kbps
font:
+ enable: true
+ # Font options:
+ # `external: true` will load this font family from `host` above.
+ # `family: Times New Roman`. Without any quotes.
+ # `size: x.x`. Use `em` as unit. Default: 1 (16px)
+
+ # Global font settings used for all elements inside <body>.
+ global:
+ external: true
+ family: Mulish
+ size:
+
+ # Font settings for alternate title.
+ logo:
+ external: true
+ family: Fredericka the Great
+ size: 3.5
+
+ # Font settings for site title.
+ title:
+ external: true
+ family: Noto Serif JP
+ size: 2.5
+
+ # Font settings for headlines (<h1> to <h6>).
+ headings:
+ external: true
+ family: Noto Serif SC
+ size:
+
+ # Font settings for posts.
+ posts:
+ external: true
+ family:
+
+ # Font settings for <code> and code blocks.
+ codes:
+ external: true
+ family: Inconsolata
+
IMAP(Internet Mail Access Protocol)以前称作交互邮件访问协议(Interactive Mail Access Protocol),是一个应用层协议。IMAP是斯坦福大学在1986年开发的一种邮件获取协议。它的主要作用是邮件客户端可以通过这种协议从邮件服务器上获取邮件的信息,下载邮件等。当前的权威定义是RFC3501。IMAP协议运行在TCP/IP协议之上,使用的端口是143。它与POP3协议的主要区别是用户可以不用把所有的邮件全部下载,可以通过客户端直接对服务器上的邮件进行操作,提供了SSL加密的IMAP协议被称为IMAP S,POP3 默认端口143,POP3S默认端口993。
W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=android, name=id, value=0x100b0001
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=, name=layout, value=0x10030009
+W: Could not decode attr value, using undecoded value instead: ns=, name=style, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=android, name=textAppearance, value=0x100d0058
+W: Could not decode attr value, using undecoded value instead: ns=, name=style, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=android, name=textAppearance, value=0x100d008f
+W: Could not decode attr value, using undecoded value instead: ns=miui, name=fabColor, value=0x7f06002e
+W: Could not decode attr value, using undecoded value instead: ns=android, name=height, value=0x100a0003
+W: Could not decode attr value, using undecoded value instead: ns=android, name=width, value=0x100a0003
+I: Decoding values */* XMLs...
+Can't find framework resources for package of id: 16. You must install proper framework files, see project website for more info.
+
C:\Users\dyt\Desktop\dex-tools-2.1-SNAPSHOT>d2j-dex2jar.bat classes.dex
+dex2jar classes.dex -> .\classes-dex2jar.jar
+Detail Error Information in File .\classes-error.zip
+Please report this file to one of following link if possible (any one).
+ https://sourceforge.net/p/dex2jar/tickets/
+ https://bitbucket.org/pxb1988/dex2jar/issues
+ https://github.com/pxb1988/dex2jar/issues [no attachment support, not preferred]
+ dex2jar@googlegroups.com
+
数据通信的任务是传输( D )代码的比特序列。
+A. 十进制 B. 帧结构 C. 分组结构 D. 二进制
+
( B )信号的电平是连续变化的。
+A. 数字 B. 模拟 C. 脉冲 D. 二进制
+
( C)是指将数字信号转变成可以在电话线上传输的模拟信号的过程。
+A. 解调 B. 采样 C. 调制 D. 压缩
+
数据传输速率是指每秒钟传输构成数据二进制代码的(D )数。
+A. 码元 B. 信元 C. 波特 D. 位
+
利用模拟通信信道传输数据信号的方法称为( A )。
+A. 频带传输 B. 基带传输 C. 异步传输 D. 同步传输
+
基带传输是指在数字通信信道上( C )传输数字数据信号的方法。
+A. 调制 B. 脉冲编码 C. 直接 D. 间接
+
数据在通信信道传输的过程中,对数据传输的误码率影响最主要的因素是( D )。
+A. 传输速率 B. 调制解调器 C. 传输介质 D. 噪声强度
+9.Internet上的数据交换采用的是( A )。
+A. 分组交换 B. 电路交换 C. 报文交换 D. 光交换
+
FDM是指( A )。
+A. 频分多路复用 B. 时分多路复用 C. 波分多路复用 D. 码分多路利用
+
利用( A ),数字数据可以用模拟信号来表示。
+A. 调制解调器 B. 编码解码器 C. 串联放大器 D. 电话网络
+
在数据通信系统中,传输介质的功能是( D )。
+A. 在信源与信宿之间传输信息 B.纠正传输过程中的错误
+C. 根据环境状况自动调整信号形式 D. 将信号从一端传至另一端
+
在光纤中采用的多路复用技术是( C )。
+A. 时分多路复用 B. 频分多路复用 C. 波分多路复用 D. 码分多路复用
+
为了实现长距离传输,模拟传输系统都使用放大器来使信号中的能量得到增加,其噪声分量( A )。
+A. 增大 B. 减小 C. 不变 D. 不一定
+
“复用”是一种将若干个彼此独立的信号合并为一个可在同一信道上传输的( C )。
+A. 调制信号 B. 已调信号 C. 复用信号 D. 单边带信号
+
物理层4个重要特性:机械特性、功能特性、电气特性和(A)。
+A. 规程特性 B. 接口特性 C.协议特性 D. 物理特性
+17. 基带系统使用(C)进行传输的。
+A. 模拟信号 B. 调制信号 C. 数字信号 D. 载波信号
+18. 下列关于异步传输说法正确的是(D)。
+A. 一次传输一个数据块 B. 对时序的要求较高
+C. 收/发端不需要进行同步 D. 数据传输速率低
+19. 低通通道带宽为5KHz,编码采用512级分级信号,最大数据传输率(D)。
+A. 32 kbps B. 48 kbps C. 64 kbps D. 90 kbps