-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.html
1 lines (1 loc) · 23.6 KB
/
index.html
1
<!-- build time:Sun Nov 03 2024 13:22:56 GMT+0800 (中国标准时间) --><!DOCTYPE html><html lang="zh-CN"><head><meta charset="UTF-8"><meta name="viewport" content="width=device-width,initial-scale=1,maximum-scale=2"><meta name="theme-color" content="#FFF"><link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon.png"><link rel="icon" type="image/ico" sizes="32x32" href="/images/favicon.ico"><meta http-equiv="Cache-Control" content="no-transform"><meta http-equiv="Cache-Control" content="no-siteapp"><link rel="alternate" type="application/rss+xml" title="R1ck's Playground" href="https://how2051.github.io/rss.xml"><link rel="alternate" type="application/atom+xml" title="R1ck's Playground" href="https://how2051.github.io/atom.xml"><link rel="alternate" type="application/json" title="R1ck's Playground" href="https://how2051.github.io/feed.json"><link rel="stylesheet" href="//fonts.googleapis.com/css?family=Mulish:300,300italic,400,400italic,700,700italic%7CFredericka%20the%20Great:300,300italic,400,400italic,700,700italic%7CNoto%20Serif%20JP:300,300italic,400,400italic,700,700italic%7CNoto%20Serif%20SC:300,300italic,400,400italic,700,700italic%7CInconsolata:300,300italic,400,400italic,700,700italic&display=swap&subset=latin,latin-ext"><link rel="stylesheet" href="/css/app.css?v=0.2.5"><link rel="canonical" href="https://how2051.github.io/"><title>R1ck's Playground</title><meta name="generator" content="Hexo 7.0.0"></head><body itemscope itemtype="http://schema.org/WebPage"><div id="loading"><div class="cat"><div class="body"></div><div class="head"><div class="face"></div></div><div class="foot"><div class="tummy-end"></div><div class="bottom"></div><div class="legs left"></div><div class="legs right"></div></div><div class="paw"><div class="hands left"></div><div class="hands right"></div></div></div></div><div id="container"><header id="header" itemscope itemtype="http://schema.org/WPHeader"><div class="inner"><div id="brand"><div class="pjax"><a href="/" class="logo" rel="start"><h1 itemprop="name headline" class="title">R1ck's Playground</h1></a></div></div><nav id="nav"><div class="inner"><div class="toggle"><div class="lines" aria-label="切换导航栏"><span class="line"></span> <span class="line"></span> <span class="line"></span></div></div><ul class="menu"><li class="item title"><a href="/" rel="start">R1ck's Playground</a></li></ul><ul class="right"><li class="item theme"><i class="ic i-sun"></i></li><li class="item search"><i class="ic i-search"></i></li></ul></div></nav></div><div id="imgs" class="pjax"><ul><li class="item" data-background-image="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></li><li class="item" data-background-image="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></li><li class="item" data-background-image="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></li><li class="item" data-background-image="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></li><li class="item" data-background-image="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></li><li class="item" data-background-image="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></li></ul></div></header><div id="waves"><svg class="waves" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" viewBox="0 24 150 28" preserveAspectRatio="none" shape-rendering="auto"><defs><path id="gentle-wave" d="M-160 44c30 0 58-18 88-18s 58 18 88 18 58-18 88-18 58 18 88 18 v44h-352z"/></defs><g class="parallax"><use xlink:href="#gentle-wave" x="48" y="0"/><use xlink:href="#gentle-wave" x="48" y="3"/><use xlink:href="#gentle-wave" x="48" y="5"/><use xlink:href="#gentle-wave" x="48" y="7"/></g></svg></div><main><div class="inner"><div id="main" class="pjax"><div class="index wrap"><h2 class="divider">文章列表</h2><div class="segments posts"><article class="item"><div class="cover"><a href="/2024/11/03/007-%E4%BA%8C%E5%8F%89%E6%A0%91/" itemprop="url" title="007_二叉树"><img data-src="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间：2024-11-03 09:32:31"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-11-03T09:32:31+08:00">2024-11-03</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>42k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>39 分钟</span></span></div><h3><a href="/2024/11/03/007-%E4%BA%8C%E5%8F%89%E6%A0%91/" itemprop="url" title="007_二叉树">007_二叉树</a></h3><div class="excerpt"># 一、理论基础 要了解二叉树的几种类型 / 定义； 要熟悉几种遍历方式： 深度优先遍历 前序遍历（递归法，迭代法） 中序遍历（递归法，迭代法） 后序遍历（递归法，迭代法） 广度优先遍历 层次遍历（迭代法） 见 [[二叉树_0.png]]、[[二叉树_1.png]] # 1.1 递归法 # i、递归法前序遍历： 123456void preorderTraversal(TreeNode* cur, vector&lt;int&gt;&amp; vec) &#123; if(cur == nullptr) return;...</div><div class="meta footer"><span><a href="/categories/%E7%BC%96%E7%A8%8B/Leetcode/" itemprop="url" title="Leetcode"><i class="ic i-flag"></i>Leetcode</a></span></div><a href="/2024/11/03/007-%E4%BA%8C%E5%8F%89%E6%A0%91/" itemprop="url" title="007_二叉树" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/2024/11/03/006-%E6%A0%88%E4%B8%8E%E9%98%9F%E5%88%97/" itemprop="url" title="006_栈与队列"><img data-src="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间：2024-11-03 09:30:38"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-11-03T09:30:38+08:00">2024-11-03</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>9.6k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>9 分钟</span></span></div><h3><a href="/2024/11/03/006-%E6%A0%88%E4%B8%8E%E9%98%9F%E5%88%97/" itemprop="url" title="006_栈与队列">006_栈与队列</a></h3><div class="excerpt"># 一、理论基础 栈是先进后出，队列是先进先出，二者在 STL 中都是容器适配器，其底层实现可依靠 deque、list 等容器。 # 二、题目实践 # 1、232. 用栈实现队列 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849class MyQueue &#123;public: MyQueue() &#123; // &#125; void push(int x) &#123; _st1.push(x); &#125;...</div><div class="meta footer"><span><a href="/categories/%E7%BC%96%E7%A8%8B/Leetcode/" itemprop="url" title="Leetcode"><i class="ic i-flag"></i>Leetcode</a></span></div><a href="/2024/11/03/006-%E6%A0%88%E4%B8%8E%E9%98%9F%E5%88%97/" itemprop="url" title="006_栈与队列" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/2024/10/26/003-%E5%93%88%E5%B8%8C%E8%A1%A8/" itemprop="url" title="003_哈希表"><img data-src="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间：2024-10-26 11:17:15"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-10-26T11:17:15+08:00">2024-10-26</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>5.6k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>5 分钟</span></span></div><h3><a href="/2024/10/26/003-%E5%93%88%E5%B8%8C%E8%A1%A8/" itemprop="url" title="003_哈希表">003_哈希表</a></h3><div class="excerpt"># 一、理论基础 哈希法使用的场景通常为需要快速判断一个元素是否出现在集合里，哈希表牺牲空间换取时间。 哈希表通过哈希函数来进行 key 和 value 的映射。 映射时，可能会发生哈希碰撞。（尤其是元素数量大于容器数量的时候） 解决哈希碰撞有拉链法和线性探测法。 C++ 中常见的三种哈希结构：数组（array、vector）、集合（set）、映射（map）。 集合 底层实现 是否有序 数值是否可以重复 能否更改数值 查询效率 增删效率 std::set 红黑树 有序 否 否 O(log n) O(log n) std::multiset 红黑树 有序 是 否 O(log...</div><div class="meta footer"><span><a href="/categories/%E7%BC%96%E7%A8%8B/Leetcode/" itemprop="url" title="Leetcode"><i class="ic i-flag"></i>Leetcode</a></span></div><a href="/2024/10/26/003-%E5%93%88%E5%B8%8C%E8%A1%A8/" itemprop="url" title="003_哈希表" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/2024/10/26/002-%E9%93%BE%E8%A1%A8/" itemprop="url" title="002_链表"><img data-src="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间：2024-10-26 11:15:45"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-10-26T11:15:45+08:00">2024-10-26</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>9.7k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>9 分钟</span></span></div><h3><a href="/2024/10/26/002-%E9%93%BE%E8%A1%A8/" itemprop="url" title="002_链表">002_链表</a></h3><div class="excerpt"># 一、理论基础 也没什么特别的。离散存储、不支持随机访问。 链表节点的定义： 1234567template &lt;class T&gt;struct _listNode &#123; void* m_prev; void* m_next; T m_data; _listNode(T x) : m_data(x), m_next(nullptr), m_prev(nullptr) &#123;&#125;&#125;; # 二、题目实践 # 1、203....</div><div class="meta footer"><span><a href="/categories/%E7%BC%96%E7%A8%8B/Leetcode/" itemprop="url" title="Leetcode"><i class="ic i-flag"></i>Leetcode</a></span></div><a href="/2024/10/26/002-%E9%93%BE%E8%A1%A8/" itemprop="url" title="002_链表" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/2024/10/26/001-%E6%95%B0%E7%BB%84/" itemprop="url" title="001_数组"><img data-src="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间：2024-10-26 11:13:18"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-10-26T11:13:18+08:00">2024-10-26</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>7.8k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>7 分钟</span></span></div><h3><a href="/2024/10/26/001-%E6%95%B0%E7%BB%84/" itemprop="url" title="001_数组">001_数组</a></h3><div class="excerpt"># 一、理论基础 几乎无。只要记住数组是相同类型、连续存储、支持随机访问的。 # 二、题目实践 # 1、704. 二分查找 #双指针 没啥难度的，基本一次过，以下是个人版本： 12345678910111213141516class Solution &#123;public: int search(vector&lt;int&gt;&amp; nums, int target) &#123; int left = 0, right = nums.size() - 1; while(left &lt;= right) &#123; int...</div><div class="meta footer"><span><a href="/categories/%E7%BC%96%E7%A8%8B/Leetcode/" itemprop="url" title="Leetcode"><i class="ic i-flag"></i>Leetcode</a></span></div><a href="/2024/10/26/001-%E6%95%B0%E7%BB%84/" itemprop="url" title="001_数组" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/2024/10/22/packaged-task/" itemprop="url" title="packaged_task"><img data-src="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间：2024-10-22 16:41:52"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-10-22T16:41:52+08:00">2024-10-22</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>3.8k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>3 分钟</span></span></div><h3><a href="/2024/10/22/packaged-task/" itemprop="url" title="packaged_task">packaged_task</a></h3><div class="excerpt">The class template std::packaged_task wraps any callable target (function, lambda expression, bind expression, or another function object) so that it can be invoked asynchronously. Its return value or exception thrown is stored in a shared state which can be accessed through std::future...</div><div class="meta footer"><span><a href="/categories/%E7%BC%96%E7%A8%8B/C/asynchronous/" itemprop="url" title="asynchronous"><i class="ic i-flag"></i>asynchronous</a></span></div><a href="/2024/10/22/packaged-task/" itemprop="url" title="packaged_task" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/2024/10/22/future/" itemprop="url" title="future"><img data-src="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间：2024-10-22 16:40:46"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-10-22T16:40:46+08:00">2024-10-22</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>2.7k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>2 分钟</span></span></div><h3><a href="/2024/10/22/future/" itemprop="url" title="future">future</a></h3><div class="excerpt">std::future 是 C++ 标准库中的一个类模板，用于表示一个异步操作的结果，可用于从一个线程获取另一个线程计算的结果。 std::future 还可以与 std::promise 、 std::async 、 std::packaged_task 结合使用，用于实现更复杂的异步任务管理。 简单来说， std::future 提供了一种获取异步操作的结果的机制： 一个异步操作（通过 std::async 、 std::packaged_task 或 std::promise 创建）能够向其创建者提供一个 std::future 对象，使用者可以利用 std::future...</div><div class="meta footer"><span><a href="/categories/%E7%BC%96%E7%A8%8B/C/asynchronous/" itemprop="url" title="asynchronous"><i class="ic i-flag"></i>asynchronous</a></span></div><a href="/2024/10/22/future/" itemprop="url" title="future" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/2024/10/22/promise/" itemprop="url" title="promise"><img data-src="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间：2024-10-22 16:39:50"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-10-22T16:39:50+08:00">2024-10-22</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>5.1k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>5 分钟</span></span></div><h3><a href="/2024/10/22/promise/" itemprop="url" title="promise">promise</a></h3><div class="excerpt">The class template std::promise provides a facility to store a value or an exception that is later acquired asynchronously via a std::future object created by the std::promise object. Note that the std::promise object is meant to be used only once. -- cppreference/promise # 1、概述 std::promise 是...</div><div class="meta footer"><span><a href="/categories/%E7%BC%96%E7%A8%8B/C/asynchronous/" itemprop="url" title="asynchronous"><i class="ic i-flag"></i>asynchronous</a></span></div><a href="/2024/10/22/promise/" itemprop="url" title="promise" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/2024/10/22/async/" itemprop="url" title="async"><img data-src="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间：2024-10-22 16:38:42"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-10-22T16:38:42+08:00">2024-10-22</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>2.6k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>2 分钟</span></span></div><h3><a href="/2024/10/22/async/" itemprop="url" title="async">async</a></h3><div class="excerpt">std::async 是 C++11 标准库中引入的一个函数模板，用于启动一个异步任务，并返回一个 std::future 对象，用于获取异步任务的结果。 std::async 提供了一种简单的方式来并行化代码执行，而不需要显式地管理线程的生命周期。 # 1、作用 启动异步任务： std::async 启动一个新的任务，这个任务可以在新线程中并行执行。 管理任务结果： std::async 返回一个 std::future 对象，允许调用者在异步任务完成后获取结果。 简化并发编程：与直接使用 std::thread 相比， std::async...</div><div class="meta footer"><span><a href="/categories/%E7%BC%96%E7%A8%8B/C/asynchronous/" itemprop="url" title="asynchronous"><i class="ic i-flag"></i>asynchronous</a></span></div><a href="/2024/10/22/async/" itemprop="url" title="async" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/2024/10/22/thread/" itemprop="url" title="thread"><img data-src="https://ooo.0x0.ooo/2023/12/08/OAE0e6.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间：2024-10-22 16:37:16"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-10-22T16:37:16+08:00">2024-10-22</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>2.3k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>2 分钟</span></span></div><h3><a href="/2024/10/22/thread/" itemprop="url" title="thread">thread</a></h3><div class="excerpt">std::thread 是 C++11 标准库中的一个类，用于创建和管理线程。它提供了一种并发编程的机制，使得一个程序可以同时执行多个任务，提高程序的执行效率和响应能力。 # 1、构造函数及其参数 std::thread 的构造函数有多种形式，常见的使用方法如下： 普通函数: 12void function_name(int arg1, double arg2);std::thread t1(function_name, 10, 3.14); 这里 function_name...</div><div class="meta footer"><span><a href="/categories/%E7%BC%96%E7%A8%8B/C/asynchronous/" itemprop="url" title="asynchronous"><i class="ic i-flag"></i>asynchronous</a></span></div><a href="/2024/10/22/thread/" itemprop="url" title="thread" class="btn">more...</a></div></article></div></div><nav class="pagination"><div class="inner"><span class="page-number current">1</span><a class="page-number" href="/page/2/">2</a><a class="page-number" href="/page/3/">3</a><a class="extend next" rel="next" href="/page/2/"><i class="ic i-angle-right" aria-label="下一页"></i></a></div></nav></div><div id="sidebar"><div class="inner"><div class="panels"><div class="inner"><div class="contents panel pjax" data-title="文章目录"></div><div class="related panel pjax" data-title="系列文章"></div><div class="overview panel" data-title="站点概览"><div class="author" itemprop="author" itemscope itemtype="http://schema.org/Person"><img class="image" itemprop="image" alt="Rick" data-src="/images/avatar.jpg"><p class="name" itemprop="name">Rick</p><div class="description" itemprop="description"></div></div><nav class="state"><div class="item posts"><a href="/archives/"><span class="count">30</span> <span class="name">文章</span></a></div><div class="item categories"><a href="/categories/"><span class="count">4</span> <span class="name">分类</span></a></div><div class="item tags"><a href="/tags/"><span class="count">10</span> <span class="name">标签</span></a></div></nav><div class="social"><span class="exturl item github" data-url="aHR0cHM6Ly9naXRodWIuY29tL2hvdzIwNTE=" title="https://github.com/how2051"><i class="ic i-github"></i></span> <span class="exturl item about" data-url="aHR0cHM6Ly9hYm91dC5tZS95b3VybmFtZQ==" title="https://about.me/yourname"><i class="ic i-address-card"></i></span> <span class="exturl item email" data-url="bWFpbHRvOmNoZW5oYW9fcHVibGljQDE2My5jb20=" title="mailto:[email protected]"><i class="ic i-envelope"></i></span></div><ul class="menu"><li class="item"><a href="/" rel="section"><i class="ic i-home"></i>首页</a></li><li class="item"><a href="/about/" rel="section"><i class="ic i-user"></i>关于</a></li><li class="item dropdown"><a href="javascript:void(0);"><i class="ic i-feather"></i>文章</a><ul class="submenu"><li class="item"><a href="/archives/" rel="section"><i class="ic i-list-alt"></i>归档</a></li><li class="item"><a href="/categories/" rel="section"><i class="ic i-th"></i>分类</a></li><li class="item"><a href="/tags/" rel="section"><i class="ic i-tags"></i>标签</a></li></ul></li></ul></div></div></div><ul id="quick"><li class="prev pjax"></li><li class="up"><i class="ic i-arrow-up"></i></li><li class="down"><i class="ic i-arrow-down"></i></li><li class="next pjax"><a href="/page/2/" rel="next" title="下一篇"><i class="ic i-chevron-right"></i></a></li><li class="percent"></li></ul></div></div><div class="dimmer"></div></div></main><footer id="footer"><div class="inner"><div class="widgets"></div><div class="status"><div class="copyright">© 2023 – <span itemprop="copyrightYear">2024</span> <span class="with-love"><i class="ic i-sakura rotate"></i> </span><span class="author" itemprop="copyrightHolder">Rick @ R1ck's Playground</span></div><div class="count"><span class="post-meta-item-icon"><i class="ic i-chart-area"></i> </span><span title="站点总字数">286k 字</span> <span class="post-meta-divider">|</span> <span class="post-meta-item-icon"><i class="ic i-coffee"></i> </span><span title="站点阅读时长">4:20</span></div><div class="powered-by">基于 <span class="exturl" data-url="aHR0cHM6Ly9oZXhvLmlv">Hexo</span> & Theme.<span class="exturl" data-url="aHR0cHM6Ly9naXRodWIuY29tL2FtZWhpbWUvaGV4by10aGVtZS1zaG9rYQ==">Shoka</span></div></div></div></footer></div><script data-config type="text/javascript">var LOCAL={path:"",favicon:{show:"欢迎回来~",hide:"等你回来~"},search:{placeholder:"文章搜索",empty:"关于 「 ${query} 」，什么也没搜到",stats:"${time} ms 内找到 ${hits} 条结果"},valine:!0,fancybox:!0,copyright:'复制成功，转载请遵守 <i class="ic i-creative-commons"></i>BY-NC-SA 协议。',ignores:[function(e){return e.includes("#")},function(e){return new RegExp(LOCAL.path+"$").test(e)}]}</script><script src="https://cdn.polyfill.io/v2/polyfill.js"></script><script src="//cdn.jsdelivr.net/combine/npm/[email protected]/pace.min.js,npm/[email protected]/pjax.min.js,npm/[email protected]/dist/fetch.umd.min.js,npm/[email protected]/lib/anime.min.js,npm/algoliasearch@4/dist/algoliasearch-lite.umd.js,npm/instantsearch.js@4/dist/instantsearch.production.min.js,npm/lozad@1/dist/lozad.min.js,npm/quicklink@2/dist/quicklink.umd.js"></script><script src="/js/app.js?v=0.2.5"></script></body></html><!-- rebuild by hrmmi -->