-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.html
1 lines (1 loc) · 27.9 KB
/
index.html
1
<!-- build time:Mon Feb 12 2024 16:33:11 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="haruhiui" href="http://haruhiui.github.io/rss.xml"><link rel="alternate" type="application/atom+xml" title="haruhiui" href="http://haruhiui.github.io/atom.xml"><link rel="alternate" type="application/json" title="haruhiui" href="http://haruhiui.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="http://haruhiui.github.io/"><title>Starlight = haruhiui = 約束タワーで待ってて</title><meta name="generator" content="Hexo 5.4.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"><p class="artboard">Starlight</p><h1 itemprop="name headline" class="title">haruhiui</h1></a><p class="meta" itemprop="description">= 約束タワーで待ってて =</p></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">Starlight</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://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IaFnsk.png"></li><li class="item" data-background-image="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/LPKPdf.png"></li><li class="item" data-background-image="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/LPC9YT.png"></li><li class="item" data-background-image="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IaEmfC.jpg"></li><li class="item" data-background-image="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IaF1nX.png"></li><li class="item" data-background-image="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IaEkH5.png"></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="/Computer-Graphics/ASTC-Texture-Format/" itemprop="url" title="ASTC Texture Format"><img data-src="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IasNND.png"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间:2024-02-12 13:49:14"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2024-02-12T13:49:14+08:00">2024-02-12</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>1.3k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>1 分钟</span></span></div><h3><a href="/Computer-Graphics/ASTC-Texture-Format/" itemprop="url" title="ASTC Texture Format">ASTC Texture Format</a></h3><div class="excerpt"># ASTC 纹理格式 一般的纹理压缩格式都有两个要素,color endpoint 和 weight grid,即端点颜色和权重表,具体的数据部分由权重表示,在解压时通过权重从两个端点颜色之间插值出结果颜色。 weight grid 数据部分的大小定义为 grid size。另一个和 size 相关的概念是 block size,表示将几乘几的像素一起进行压缩。ASTC 格式的压缩结果都是 128 bits,ASTC4X4 就是将 4X4 的像素压缩到 128 bits,这样平均每个像素有 8 bits 数据;ASTC6X6 则是将 6X6 的像素数据压缩到 128...</div><div class="meta footer"><span><a href="/categories/Computer-Graphics/" itemprop="url" title="Computer Graphics"><i class="ic i-flag"></i>Computer Graphics</a></span></div><a href="/Computer-Graphics/ASTC-Texture-Format/" itemprop="url" title="ASTC Texture Format" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/Data-Structures-and-Algorithms/Binary-Exponentiation/" itemprop="url" title="Binary Exponentiation"><img data-src="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IaEaeS.png"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间:2021-12-26 23:01:03"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2021-12-26T23:01:03+08:00">2021-12-26</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>658</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>1 分钟</span></span></div><h3><a href="/Data-Structures-and-Algorithms/Binary-Exponentiation/" itemprop="url" title="Binary Exponentiation">Binary Exponentiation</a></h3><div class="excerpt"># Binary Exponentiation Binary Exponentiation 快速幂算法,或者叫二进制取幂。 LeetCode 模板题:50. Pow(x, n) 递归版: bi-exp-recur.pyclass Solution: def myPow(self, x: float, n: int) -> float: if n &lt; 0: return 1 / self.myPow(x, -n) if n == 0: return 1 if n == 1: return x return self.myPow(x * x, n // 2) * (x if n...</div><div class="meta footer"><span><a href="/categories/Data-Structures-and-Algorithms/" itemprop="url" title="Data Structures and Algorithms"><i class="ic i-flag"></i>Data Structures and Algorithms</a></span></div><a href="/Data-Structures-and-Algorithms/Binary-Exponentiation/" itemprop="url" title="Binary Exponentiation" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/Data-Structures-and-Algorithms/Lowest-Common-Ancestor/" itemprop="url" title="Lowest Common Ancestor"><img data-src="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IasL0f.png"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间:2021-12-23 18:54:47"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2021-12-23T18:54:47+08:00">2021-12-23</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>9.5k</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="/Data-Structures-and-Algorithms/Lowest-Common-Ancestor/" itemprop="url" title="Lowest Common Ancestor">Lowest Common Ancestor</a></h3><div class="excerpt"># LCA 一个树的 Lowest Common Ancestor 最近公共祖先。 这篇文章主要目的是在于寻找解决类似 LCA 问题的统一方法。就图一乐 # 两个结点都存在 LeetCode 模板题:236. 二叉树的最近公共祖先 lc236.py# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def lowestCommonAncestor(self,...</div><div class="meta footer"><span><a href="/categories/Data-Structures-and-Algorithms/" itemprop="url" title="Data Structures and Algorithms"><i class="ic i-flag"></i>Data Structures and Algorithms</a></span></div><a href="/Data-Structures-and-Algorithms/Lowest-Common-Ancestor/" itemprop="url" title="Lowest Common Ancestor" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/Data-Structures-and-Algorithms/Length-of-LIS/" itemprop="url" title="Length of LIS"><img data-src="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/LPCz1u.png"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间:2021-12-20 23:45:40"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2021-12-20T23:45:40+08:00">2021-12-20</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>2.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="/Data-Structures-and-Algorithms/Length-of-LIS/" itemprop="url" title="Length of LIS">Length of LIS</a></h3><div class="excerpt"># Length of LIS LIS: Longest Increasing Subsequence 最长递增子序列。Length of LIS 就是求一个数组中最长子序列的长度。 300. Longest Increasing Subsequence 总的来说,有两种方法,一种是 DP,另一种还是 DP。 第一种 DP: len-LIS-1.pyclass Solution: def lengthOfLIS(self, nums: List[int]) -> int: n = len(nums) dp = [1] * n for i in range(n): for j in...</div><div class="meta footer"><span><a href="/categories/Data-Structures-and-Algorithms/" itemprop="url" title="Data Structures and Algorithms"><i class="ic i-flag"></i>Data Structures and Algorithms</a></span></div><a href="/Data-Structures-and-Algorithms/Length-of-LIS/" itemprop="url" title="Length of LIS" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/Data-Structures-and-Algorithms/Binary-Tree-Traversal/" itemprop="url" title="Binary Tree Traversal"><img data-src="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IaFJzp.png"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间:2021-12-17 22:51:44"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2021-12-17T22:51:44+08:00">2021-12-17</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>4.6k</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>4 分钟</span></span></div><h3><a href="/Data-Structures-and-Algorithms/Binary-Tree-Traversal/" itemprop="url" title="Binary Tree Traversal">Binary Tree Traversal</a></h3><div class="excerpt">Binary Tree Traversal 二叉树遍历。 前序、中序、后序遍历用到的数据结构都是栈,使用 Python 的 list 来表示栈,有 append() 和 pop() 方法,都是 O(1) 时间。需要注意的是 list 的带参数的 pop(i) 复杂度是 O(n) 。(所以一般如果要用队列的话最好不要用 list 而是用 collections.deque() 的 append() 和 popleft() 来达到 O(1) 。) # 前序遍历 LeetCode 模板题:144. 二叉树的前序遍历 顺序是根左右。 递归版: preorder-recur.py# Definition...</div><div class="meta footer"><span><a href="/categories/Data-Structures-and-Algorithms/" itemprop="url" title="Data Structures and Algorithms"><i class="ic i-flag"></i>Data Structures and Algorithms</a></span></div><a href="/Data-Structures-and-Algorithms/Binary-Tree-Traversal/" itemprop="url" title="Binary Tree Traversal" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/Data-Structures-and-Algorithms/Trie/" itemprop="url" title="Trie"><img data-src="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IaF6GC.jpg"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间:2021-12-02 20:51:12"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2021-12-02T20:51:12+08:00">2021-12-02</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>3.5k</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="/Data-Structures-and-Algorithms/Trie/" itemprop="url" title="Trie">Trie</a></h3><div class="excerpt"># Trie 前缀树。 借鉴自 宫水三叶 大佬的 【设计数据结构】实现 Trie (前缀树)。 Trie 树(又叫「前缀树」或「字典树」)是一种用于快速查询「某个字符串 / 字符前缀」是否存在的数据结构。 其核心是使用「边」来代表有无字符,使用「点」来记录是否为「单词结尾」以及「其后续字符串的字符是什么」。 # 208. 实现 Trie (前缀树) 实现 Trie 类: Trie () 初始化前缀树对象。 void insert (String word) 向前缀树中插入字符串 word 。 boolean search (String word) 如果字符串 word 在前缀树中,返回...</div><div class="meta footer"><span><a href="/categories/Data-Structures-and-Algorithms/" itemprop="url" title="Data Structures and Algorithms"><i class="ic i-flag"></i>Data Structures and Algorithms</a></span></div><a href="/Data-Structures-and-Algorithms/Trie/" itemprop="url" title="Trie" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/Data-Structures-and-Algorithms/Other/" itemprop="url" title="Other"><img data-src="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IasMOR.png"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间:2021-12-02 18:51:08"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2021-12-02T18:51:08+08:00">2021-12-02</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>912</span> <span class="text">字</span> </span><span class="item" title="阅读时长"><span class="icon"><i class="ic i-clock"></i> </span><span>1 分钟</span></span></div><h3><a href="/Data-Structures-and-Algorithms/Other/" itemprop="url" title="Other">Other</a></h3><div class="excerpt"># 博弈论 292. Nim 游戏 只要 n 不能被 4 整除即可。 lc292-1.pyclass Solution: def canWinNim(self, n: int) -> bool: return n % 4 != 0810. 黑板异或游戏 说到异或我想到之前面试时面试官问的一道题,这里顺便说一下:一个数组里只有一个数字单独出现了一次,其他数字都出现了两次,如何找出这个数字。 对一个数异或偶数次结果都是 0,所以把这个数组所有元素进行异或的结果就是单独的数字。 那么如果这个数组有两个不同的、只出现了一次的数字,该怎么找出来? ……...</div><div class="meta footer"><span><a href="/categories/Data-Structures-and-Algorithms/" itemprop="url" title="Data Structures and Algorithms"><i class="ic i-flag"></i>Data Structures and Algorithms</a></span></div><a href="/Data-Structures-and-Algorithms/Other/" itemprop="url" title="Other" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/Data-Structures-and-Algorithms/Linked-List/" itemprop="url" title="Linked List"><img data-src="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IaFLXO.png"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间:2021-12-02 18:51:08"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2021-12-02T18:51:08+08:00">2021-12-02</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>5.5k</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="/Data-Structures-and-Algorithms/Linked-List/" itemprop="url" title="Linked List">Linked List</a></h3><div class="excerpt">Linked List 链表。 面试时要是有链表相关题目,需要问清楚是单链表还是双链表、有没有可能有环。 # 亿点点练习题 # 206. Reverse Linked List 最基础的反转链表。 lc206-1.py# Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution: def reverseList(self, head: Optional[ListNode])...</div><div class="meta footer"><span><a href="/categories/Data-Structures-and-Algorithms/" itemprop="url" title="Data Structures and Algorithms"><i class="ic i-flag"></i>Data Structures and Algorithms</a></span></div><a href="/Data-Structures-and-Algorithms/Linked-List/" itemprop="url" title="Linked List" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/Data-Structures-and-Algorithms/DFS/" itemprop="url" title="DFS"><img data-src="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/LPCMZW.png"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间:2021-12-02 18:50:30"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2021-12-02T18:50:30+08:00">2021-12-02</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>2.5k</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="/Data-Structures-and-Algorithms/DFS/" itemprop="url" title="DFS">DFS</a></h3><div class="excerpt"># 练习 # 37. 解数独 lc37-1.py class Solution: def solveSudoku(self, board: List[List[str]]) -> None: """ Do not return anything, modify board in-place instead. """ rows = [[False] * 9 for _ in range(9)] cols = [[False] * 9 for _ in range(9)] cell = [[False] * 9 for _ in...</div><div class="meta footer"><span><a href="/categories/Data-Structures-and-Algorithms/" itemprop="url" title="Data Structures and Algorithms"><i class="ic i-flag"></i>Data Structures and Algorithms</a></span></div><a href="/Data-Structures-and-Algorithms/DFS/" itemprop="url" title="DFS" class="btn">more...</a></div></article><article class="item"><div class="cover"><a href="/Data-Structures-and-Algorithms/Binary-Search/" itemprop="url" title="Binary Search"><img data-src="https://raw.githubusercontent.com/haruhiui/Blog-Gallery/master/blog-img/IasB3L.png"></a></div><div class="info"><div class="meta"><span class="item" title="创建时间:2021-11-28 16:43:59"><span class="icon"><i class="ic i-calendar"></i> </span><time itemprop="dateCreated datePublished" datetime="2021-11-28T16:43:59+08:00">2021-11-28</time> </span><span class="item" title="本文字数"><span class="icon"><i class="ic i-pen"></i> </span><span>8.1k</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="/Data-Structures-and-Algorithms/Binary-Search/" itemprop="url" title="Binary Search">Binary Search</a></h3><div class="excerpt"># 不同的写法 为什么要研究几种不同的写法?说到底只是闲的无聊罢了。 # 写法一 翻译自 Variants of Binary Search 。 binary_search_1.pydef contains(nums, low, high, key): ans = False while low &lt;= high: mid = (low + high) // 2 if nums[mid] &lt; key: low = mid + 1 elif nums[mid] > key: high = mid - 1 elif nums[mid] == key: return...</div><div class="meta footer"><span><a href="/categories/Data-Structures-and-Algorithms/" itemprop="url" title="Data Structures and Algorithms"><i class="ic i-flag"></i>Data Structures and Algorithms</a></span></div><a href="/Data-Structures-and-Algorithms/Binary-Search/" itemprop="url" title="Binary Search" class="btn">more...</a></div></article></div></div></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="haruhiui" data-src="/images/avatar.jpg"><p class="name" itemprop="name">haruhiui</p><div class="description" itemprop="description"></div></div><nav class="state"><div class="item posts"><a href="/archives/"><span class="count">10</span> <span class="name">文章</span></a></div><div class="item categories"><a href="/categories/"><span class="count">2</span> <span class="name">分类</span></a></div><div class="item tags"><a href="/tags/"><span class="count">12</span> <span class="name">标签</span></a></div></nav><div class="social"><span class="exturl item github" data-url="aHR0cHM6Ly9naXRodWIuY29tL2hhcnVoaXVp" title="https://github.com/haruhiui"><i class="ic i-github"></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><li class="item"><a href="/friend-links/" rel="section"><i class="ic i-link"></i>友链</a></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"></li><li class="percent"></li></ul></div></div><div class="dimmer"></div></div></main><footer id="footer"><div class="inner"><div class="widgets"><div class="rpost pjax"><h2>随机文章</h2><ul><li class="item"><div class="breadcrumb"><a href="/categories/Data-Structures-and-Algorithms/" title="分类于 Data Structures and Algorithms">Data Structures and Algorithms</a></div><span><a href="/Data-Structures-and-Algorithms/DFS/" title="DFS">DFS</a></span></li><li class="item"><div class="breadcrumb"><a href="/categories/Data-Structures-and-Algorithms/" title="分类于 Data Structures and Algorithms">Data Structures and Algorithms</a></div><span><a href="/Data-Structures-and-Algorithms/Trie/" title="Trie">Trie</a></span></li><li class="item"><div class="breadcrumb"><a href="/categories/Data-Structures-and-Algorithms/" title="分类于 Data Structures and Algorithms">Data Structures and Algorithms</a></div><span><a href="/Data-Structures-and-Algorithms/Other/" title="Other">Other</a></span></li><li class="item"><div class="breadcrumb"><a href="/categories/Data-Structures-and-Algorithms/" title="分类于 Data Structures and Algorithms">Data Structures and Algorithms</a></div><span><a href="/Data-Structures-and-Algorithms/Length-of-LIS/" title="Length of LIS">Length of LIS</a></span></li><li class="item"><div class="breadcrumb"><a href="/categories/Computer-Graphics/" title="分类于 Computer Graphics">Computer Graphics</a></div><span><a href="/Computer-Graphics/ASTC-Texture-Format/" title="ASTC Texture Format">ASTC Texture Format</a></span></li><li class="item"><div class="breadcrumb"><a href="/categories/Data-Structures-and-Algorithms/" title="分类于 Data Structures and Algorithms">Data Structures and Algorithms</a></div><span><a href="/Data-Structures-and-Algorithms/Binary-Exponentiation/" title="Binary Exponentiation">Binary Exponentiation</a></span></li><li class="item"><div class="breadcrumb"><a href="/categories/Data-Structures-and-Algorithms/" title="分类于 Data Structures and Algorithms">Data Structures and Algorithms</a></div><span><a href="/Data-Structures-and-Algorithms/Lowest-Common-Ancestor/" title="Lowest Common Ancestor">Lowest Common Ancestor</a></span></li><li class="item"><div class="breadcrumb"><a href="/categories/Data-Structures-and-Algorithms/" title="分类于 Data Structures and Algorithms">Data Structures and Algorithms</a></div><span><a href="/Data-Structures-and-Algorithms/Binary-Search/" title="Binary Search">Binary Search</a></span></li><li class="item"><div class="breadcrumb"><a href="/categories/Data-Structures-and-Algorithms/" title="分类于 Data Structures and Algorithms">Data Structures and Algorithms</a></div><span><a href="/Data-Structures-and-Algorithms/Binary-Tree-Traversal/" title="Binary Tree Traversal">Binary Tree Traversal</a></span></li><li class="item"><div class="breadcrumb"><a href="/categories/Data-Structures-and-Algorithms/" title="分类于 Data Structures and Algorithms">Data Structures and Algorithms</a></div><span><a href="/Data-Structures-and-Algorithms/Linked-List/" title="Linked List">Linked List</a></span></li></ul></div></div><div class="status"><div class="copyright">© 2021 – <span itemprop="copyrightYear">2024</span> <span class="with-love"><i class="ic i-sakura rotate"></i> </span><span class="author" itemprop="copyrightHolder">haruhiui @ Starlight</span></div><div class="count"><span class="post-meta-item-icon"><i class="ic i-chart-area"></i> </span><span title="站点总字数">39k 字</span> <span class="post-meta-divider">|</span> <span class="post-meta-item-icon"><i class="ic i-coffee"></i> </span><span title="站点阅读时长">36 分钟</span> <span class="post-meta-divider">|</span> <span class="post-meta-item-icon"><i class="ic i-eye"></i></span><script async src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script><span id="busuanzi_container_site_pv"><span id="busuanzi_value_site_pv"></span>次</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:"(●´3`●)やれやれだぜ",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="https://fastly.jsdelivr.net/combine/npm/pace-js@1.0.2/pace.min.js,npm/pjax@0.2.8/pjax.min.js,npm/whatwg-fetch@3.4.0/dist/fetch.umd.min.js,npm/animejs@3.2.0/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 -->