1<!DOCTYPE html><html lang="en"><head><meta charset="UTF-8"><title>Category: ACM [ o_oyao's Blog ]</title><link rel="stylesheet" href="/css/reset.css"><link rel="stylesheet" href="/css/includes/header.css"><link rel="stylesheet" href="/css/includes/footer.css"><link rel="stylesheet" href="/css/includes/locate-button.css"><link rel="stylesheet" href="/css/includes/pagination.css"><link rel="stylesheet" href="/css/last.css"><link rel="stylesheet" href="/font-awesome/css/all.min.css"><link rel="stylesheet" href="/css/includes/alert/alert.css"><link rel="stylesheet" href="/css/categories/cardPage.css"><link rel="stylesheet" href="/css/category.css">
1<script src="https://cdn.jsdelivr.net/npm/[email protected]/dist/clipboard.min.js"></script>
1<link rel="stylesheet" href="/css/last.css"><link rel="stylesheet" href="/css/fitness.css">
1<script src="https://cdnjs.cloudflare.com/ajax/libs/tocbot/4.32.2/tocbot.min.js"></script>
1<script src="https://cdn.jsdelivr.net/npm/[email protected]/dist/jquery.min.js" onerror="this.onerror=null;this.src='https://cdnjs.cloudflare.com/ajax/libs/jquery/3.7.1/jquery.min.js'"></script>
1<script src="/js/third-party/jquery-fallback.js"></script>
1<script>var isHome = false; 2var isCenter = false; 3var i18n = { 4 copy: { 5 success: "Copy successful!", 6 error: "Copy failed, please try again!" 7 } 8}; 9 10// Search configuration 11window.themeConfig = { 12 search: {"enable":true,"engine":"algolia","local":{"path":"search.xml"},"lunr":{"path":"search.json","maxResults":30,"minQueryLength":1,"debounceTime":300},"algolia":null,"google":{"cx":null}}, 13 tagsPage: {"category":{"show_count":true},"tag":{"show_count":false,"alphabet_index":true,"korean":{"enabled":false}}}, 14 i18n: { 15 localSearch: { 16 placeholder: "Type to search", 17 empty: "(ã£â¥â¯ï¹â°â¥c) Sorry I can't find the word, please try another word", 18 firstSearch: "First Search, loading index file... please wait", 19 error: "Search temporarily unavailable, please try again later" 20 } 21 } 22}; 23 24// Algolia configuration from site root _config.yml 25console.log('Debug: Setting up Algolia config from site root...'); 26window.algolia = {"appId":"HZ8RKPY89N","apiKey":"48aec148e8fd2b0e954f40864f27d4a8","adminApiKey":"b0af130184bcf8a5982192eb237d5ec8","chunkSize":5000,"indexName":"o_oyao","fields":["content:strip:truncate,0,500","excerpt:strip","tags","title","path"]}; 27if (window.algolia) { 28 console.log('â Algolia config loaded from site root:', window.algolia); 29} else { 30 console.log('â No Algolia config found in site root _config.yml'); 31 console.log('Please add algolia configuration to your site root _config.yml'); 32} 33</script>
33<meta name="generator" content="Hexo 6.3.0"></head><body class="post"><!-- Mixins, used on or off of the page--><meta name="viewport" content="width=device-width, initial-scale=1.0, minimum-scale=0.5, maximum-scale=2.0, user-scalable=yes"><div id="menu-outer"><div class="site-name"><a href=""> <?xml version="1.0" standalone="no"?> 34<svg version="1.0" xmlns="http://www.w3.org/2000/svg" width="300.000000pt" height="125.000000pt" viewBox="0 0 300.000000 125.000000" preserveAspectRatio="xMidYMid meet" id="site-logo"> 35<metadata><Created>by potrace 1.10, written by Peter Selinger 2001-2011</Created></metadata> 36<g transform="translate(0.000000,125.000000) scale(0.100000,-0.100000)" stroke="none"> 37<path class="rest-content" d="M70 635 c0 -340 4 -545 10 -545 5 0 335 27 734 60 399 33 730 60 736 60 6 0 10 28 10 70 0 56 -3 70 -15 70 -12 0 -15 -13 -15 -55 0 -48 -3 -55 -20 -55 -10 0 -320 -25 -688 -55 -368 -30 -679 -55 -691 -55 l-21 0 0 505 c0 474 1 505 18 505 9 0 316 -25 682 -55 366 -30 677 -55 693 -55 26 0 27 -2 27 -55 0 -42 3 -55 15 -55 12 0 15 14 15 70 0 55 -3 70 -15 70 -8 0 -341 27 -740 60 -399 33 -727 60 -730 60 -3 0 -5 -245 -5 -545z"/> 38<path class="rest-content" d="M301 858 c-62 -33 -94 -94 -88 -166 6 -81 51 -131 139 -154 85 -22 204 19 238 83 23 42 24 115 1 161 -32 66 -79 92 -170 96 -65 3 -83 0 -120 -20z m140 -97 c14 -46 5 -124 -17 -142 -12 -10 -18 -9 -32 5 -22 21 -24 135 -3 159 22 27 39 20 52 -22z"/> 39<path class="rest-content" d="M1230 858 c-24 -13 -53 -35 -64 -50 -24 -34 -33 -126 -16 -168 17 -42 72 -87 122 -101 82 -22 198 11 234 66 38 58 36 150 -4 204 -53 71 -182 94 -272 49z m127 -70 c27 -34 20 -151 -9 -169 -23 -15 -48 28 -48 81 0 81 28 124 57 88z"/> 40<path class="rest-content" d="M1633 872 c-22 -14 -33 -63 -33 -149 0 -69 4 -93 22 -124 30 -54 76 -74 139 -62 43 9 49 8 49 -7 0 -50 -60 -66 -128 -36 -70 32 -99 -5 -44 -56 37 -37 73 -48 146 -48 80 0 121 25 156 95 21 44 25 65 28 195 4 137 3 146 -18 173 -25 31 -72 37 -108 11 -20 -14 -22 -24 -22 -103 0 -99 -15 -135 -47 -115 -15 9 -18 27 -21 105 -2 81 -5 96 -23 112 -22 17 -75 23 -96 9z"/> 41<path class="rest-content" d="M2085 847 c-66 -66 -68 -213 -4 -277 38 -38 86 -47 146 -27 31 10 53 12 64 6 10 -5 36 -9 58 -9 62 0 71 20 71 168 0 117 -1 124 -25 147 -28 29 -70 32 -103 10 -19 -14 -24 -14 -51 0 -17 8 -51 15 -77 15 -39 0 -51 -5 -79 -33z m175 -138 c0 -65 -3 -81 -17 -86 -10 -4 -23 2 -36 18 -39 48 -8 170 39 152 10 -4 14 -26 14 -84z"/> 42<path class="rest-content" d="M2585 863 c-53 -28 -83 -63 -95 -113 -24 -100 32 -188 133 -210 101 -23 185 6 235 80 20 29 23 45 20 95 -5 74 -33 119 -92 146 -52 23 -158 25 -201 2z m125 -89 c15 -38 12 -117 -5 -141 -45 -64 -84 72 -43 150 13 25 37 21 48 -9z"/> 43<path class="rest-content" d="M666 624 c-19 -18 -21 -55 -4 -72 9 -9 69 -12 210 -12 185 0 198 1 208 19 14 27 13 47 -6 65 -23 24 -385 24 -408 0z"/> 44</g> 45</svg></a></div><div class="search"><input id="local-search-input" tpye="text" placeholder="Type to search"><span class="search-icon"><i class="fa fa-search"></i></span><div class="local-search-result-cls" id="local-search-result" data-empty="(ã£â¥â¯ï¹â°â¥c) Sorry I can't find the word, please try another word" data-first="localSearch.first"></div></div><div class="menu"><ul class="menu-icon"><li></li><li></li><li></li></ul><ul id="nav"><img class="menu-avatar" src="https://cdn.jsdelivr.net/gh/DyingDown/img-host-repo/202409161940288.png"><div class="menu-items"><li class="item-name"><a class="name-a" href="/"><i class="fas fa-home"></i> Home</a></li><li class="item-name"><a class="name-a" href="#"><i class="fas fa-list"></i> Category</a><ul class="submenu-items"><li class="subitem-name"><a href="/categories/Gallery"><i class="fas fa-camera"></i> Gallery</a></li><li class="subitem-name"><a href="/categories/ACM"><i class="fas fa-code"></i> OJ Prob</a></li><li class="subitem-name"><a href="/novel"><i class="fas fa-book-open"></i> Novel</a></li><li class="subitem-name"><a href="/categories/Essay"><i class="fas fa-feather"></i> Essay</a></li><li class="subitem-name"><a href="/categories/expn"><i class="fas fa-language"></i> English</a></li></ul></li><li class="item-name"><a class="name-a" href="#"><i class="fas fa-lightbulb"></i> About</a><ul class="submenu-items"><li class="subitem-name"><a href="/about"><i class="fas fa-heart"></i> Me</a></li><li class="subitem-name"><a href="/theme-last-guide/site/"><i class="fas fa-puzzle-piece"></i> Theme</a></li></ul></li><li class="item-name"><a class="name-a" href="/archives"><i class="fas fa-archive"></i> Archives</a></li><li class="item-name"><a class="name-a" href="#"><i class="fas fa-cog"></i>
45 Lab</a><ul class="submenu-items"><li class="subitem-name"><a href="/project"><i class="fas fa-paperclip"></i> Project</a></li><li class="subitem-name"><a href="/project/RubikCube/index.html"><i class="fas fa-cube"></i> Rubik's Cube</a></li></ul></li><li class="item-name"><a class="name-a" href="/fitness"><i class="fas fa-dumbbell"></i> Fitness</a></li><li class="item-name"><a class="name-a" href="/tags"><i class="fas fa-tag"></i> Tag</a></li><li class="item-name"><a class="name-a" href="/links"><i class="fas fa-link"></i> Friends</a></li></div></ul></div></div><div id="content-outer"><div id="content-inner"><div class="post" id="home" role="main"><div class="row flex-grid" id="grid"><div class="box-item" id="post-SW"><span class="ribbon"><a class=" externalLink" href="/tags/SW/"><span class="ri">SW</span></a></span><div class="box-body"><time datetime="2025-09-09T19:45:19.000Z">September 9th 2025</time><a class="post-link" href="/2025/09/09/Leetcode-713-Subarray-Product-Less-Than-K/"><h2 class="post-title">Leetcode 713. Subarray Product Less Than K</h2></a><a class="post-link" href="/2025/09/09/Leetcode-713-Subarray-Product-Less-Than-K/"><p>We solve the subarray product problem either with a sliding window in O(n), or by transforming products into prefix sums via logarithms and applying binary search in O(n log n).</p></a><div class="tags"><a class="tg" href="/tags/Sliding-Window/">Sliding Window</a><a class="tg" href="/tags/SW/">SW</a><a class="tg" href="/tags/Binary-Search/">Binary Search</a><a class="tg" href="/tags/Prefix/">Prefix</a></div></div></div><div class="box-item" id="post-Math"><span class="ribbon"><a class=" externalLink" href="/tags/Math/"><span class="ri">Math</span></a></span><div class="box-body"><time datetime="2025-09-09T15:28:13.000Z">September 9th 2025</time><a class="post-link" href="/2025/09/09/Leetcode-523-Continuous-Subarray-Sum/"><h2 class="post-title">Leetcode 523. Continuous Subarray Sum</h2></a><a class="post-link" href="/2025/09/09/Leetcode-523-Continuous-Subarray-Sum/"><p>If two prefix sums have the same remainder modulo k, their difference is divisible by k.</p></a><div class="tags"><a class="tg" href="/tags/Math/">Math</a><a class="tg" href="/tags/HashMap/">HashMap</a><a class="tg" href="/tags/Prefix/">Prefix</a></div></div></div><div class="box-item" id="post-Prefix"><span class="ribbon"><a class=" externalLink" href="/tags/Prefix/"><span class="ri">Prefix</span></a></span><div class="box-body"><time datetime="2025-09-09T13:21:50.000Z">September 9th 2025</time><a class="post-link" href="/2025/09/09/Leetcode-560-Subarray-Sum-Equals-K/"><h2 class="post-title">Leetcode 560. Subarray Sum Equals K</h2></a><a class="post-link" href="/2025/09/09/Leetcode-560-Subarray-Sum-Equals-K/"><p>The O(n^2) Solution is easy to understand, so I will just explain why the Hash Table works.</p></a><div class="tags"><a class="tg" href="/tags/Prefix/">Prefix</a><a class="tg" href="/tags/Hash-Table/">Hash Table</a></div></div></div><div class="box-item" id="post-Trie"><span class="ribbon"><a class=" externalLink" href="/tags/Trie/"><span class="ri">Trie</span></a></span><div class="box-body"><time datetime="2024-02-19T02:24:22.000Z">February 18th 2024</time><a class="post-link" href="/2024/02/18/LeetCode-3045-Count-Prefix-and-Suffix-Pairs-II/"><h2 class="post-title">LeetCode 3045. Count Prefix and Suffix Pairs II</h2></a><a class="post-link" href="/2024/02/18/LeetCode-3045-Count-Prefix-and-Suffix-Pairs-II/"><p>Using trie tree and z-algorithm to find prefix and suffix.</p></a><div class="tags"><a class="tg" href="/tags/Trie/">Trie</a><a class="tg" href="/tags/Z-function/">Z-function</a></div></div></div><div class="box-item" id="post-BFS"><span class="ribbon"><a class=" externalLink" href="/tags/BFS/"><span class="ri">BFS</span></a></span><div class="box-body"><time datetime="2023-07-25T15:46:59.000Z">July 25th 2023</time><a class="post-link" href="/2023/07/25/LeetCode-126-Word-Ladder-II/"><h2 class="post-title">LeetCode 126. Word Ladder II</h2></a><a class="post-link" href="/2023/07/25/LeetCode-126-Word-Ladder-II/"><p>To solve the problem, we can use a combination of BFS and backtracking.</p></a><div class="tags"><a class="tg" href="/tags/String/">String</a><a class="tg" href="/tags/BFS/">BFS</a><a class="tg" href="/tags/Backtrack/">Backtrack</a></div></div></div><div class="box-item" id="post-Heap"><span class="ribbon"><a class=" externalLink" href="/tags/Heap/"><span class="ri">Heap</span></a></span><div class="box-body"><time datetime="2023-07-03T04:33:10.000Z">July 3rd 2023</time><a class="post-link" href="/2023/07/03/LeetCode-23-Merge-k-Sorted-Lists/"><h2 class="post-title">LeetCode 23. Merge k Sorted Lists</h2></a><a class="post-link" href="/2023/07/03/LeetCode-23-Merge-k-Sorted-Lists/"><p>
45To merge k sorted linked lists efficiently, we can use a Min Heap data structure.</p></a><div class="tags"><a class="tg" href="/tags/Heap/">Heap</a><a class="tg" href="/tags/List/">List</a></div></div></div><div class="box-item" id="post-DFS"><span class="ribbon"><a class=" externalLink" href="/tags/DFS/"><span class="ri">DFS</span></a></span><div class="box-body"><time datetime="2023-07-02T00:00:44.000Z">July 1st 2023</time><a class="post-link" href="/2023/07/01/LeetCode-124-Binary-Tree-Maximum-Path-Sum/"><h2 class="post-title">LeetCode 124. Binary Tree Maximum Path Sum</h2></a><a class="post-link" href="/2023/07/01/LeetCode-124-Binary-Tree-Maximum-Path-Sum/"><p>To find the maximum path sum in a binary tree, we can use a recursive approach. The idea is to traverse the tree in a bottom-up manner and calculate the maximum path sum for each node.</p></a><div class="tags"><a class="tg" href="/tags/DFS/">DFS</a><a class="tg" href="/tags/Binary-Tree/">Binary Tree</a><a class="tg" href="/tags/Tree/">Tree</a></div></div></div><div class="box-item" id="post-SW"><span class="ribbon"><a class=" externalLink" href="/tags/SW/"><span class="ri">SW</span></a></span><div class="box-body"><time datetime="2023-06-24T03:24:39.000Z">June 23rd 2023</time><a class="post-link" href="/2023/06/23/LeetCode-30-Substring-with-Concatenation-of-All-Words/"><h2 class="post-title">LeetCode 30. Substring with Concatenation of All Words</h2></a><a class="post-link" href="/2023/06/23/LeetCode-30-Substring-with-Concatenation-of-All-Words/"><p>Because all the words are the same length, we can use hash map to check for substring from index i to index i +word length * words number.</p></a><div class="tags"><a class="tg" href="/tags/Sliding-Window/">Sliding Window</a><a class="tg" href="/tags/HashMap/">HashMap</a><a class="tg" href="/tags/SW/">SW</a></div></div></div><div class="box-item" id="post-2P"><span class="ribbon"><a class=" externalLink" href="/tags/2P/"><span class="ri">2P</span></a></span><div class="box-body"><time datetime="2023-06-21T20:49:47.000Z">June 21st 2023</time><a class="post-link" href="/2023/06/21/LeetCode-42-Trapping-Rain-Water/"><h2 class="post-title">LeetCode 42. Trapping Rain Water</h2></a><a class="post-link" href="/2023/06/21/LeetCode-42-Trapping-Rain-Water/"><p>We can calculate the water amount by columns. For position i, the water it can contains is based on the left max height column and the right max height columns.</p></a><div class="tags"><a class="tg" href="/tags/DP/">DP</a><a class="tg" href="/tags/Array/">Array</a><a class="tg" href="/tags/Two-Pointers/">Two Pointers</a><a class="tg" href="/tags/2P/">2P</a></div></div></div><div class="box-item" id="post-Greedy"><span class="ribbon"><a class=" externalLink" href="/tags/Greedy/"><span class="ri">Greedy</span></a></span><div class="box-body"><time datetime="2023-06-21T01:13:06.000Z">June 20th 2023</time><a class="post-link" href="/2023/06/20/LeetCode-135-Candy/"><h2 class="post-title">LeetCode 135. Candy</h2></a><a class="post-link" href="/2023/06/20/LeetCode-135-Candy/"><p>This problem can be see as finding peak and valley. And we need to start checking the peak in order to remove the redundant count.</p></a><div class="tags"><a class="tg" href="/tags/Array/">Array</a><a class="tg" href="/tags/Greedy/">Greedy</a></div></div></div><div class="box-item" id="post-DP"><span class="ribbon"><a class=" externalLink" href="/tags/DP/"><span class="ri">DP</span></a></span><div class="box-body"><time datetime="2023-03-18T21:14:16.000Z">March 18th 2023</time><a class="post-link" href="/2023/03/18/LeetCode-22-Generate-Parentheses/"><h2 class="post-title">LeetCode 22. Generate Parentheses</h2></a><a class="post-link" href="/2023/03/18/LeetCode-22-Generate-Parentheses/"><p>We can get the n pairs of parentheses by combining the x pairs with n-1-x pairs then combine with one pair "()".</p></a><div class="tags"><a class="tg" href="/tags/DP/">DP</a></div></div></div><div class="box-item" id="post-DP"><span class="ribbon"><a class=" externalLink" href="/tags/DP/"><span class="ri">DP</span></a></span><div class="box-body"><time datetime="2023-03-17T00:09:12.000Z">March 16th 2023</time><a class="post-link" href="/2023/03/16/LeetCode-5-Longest-Palindromic-Substring/"><h2 class="post-title">LeetCode 5. Longest Palindromic Substring</h2></a><a class="post-link" href="/2023/03/16/LeetCode-5-Longest-Palindromic-Substring/"><p>Solve using three ways.</p></a><div class="tags"><a class="tg" href="/tags/DP/">DP</a><a class="tg" href="/tags/Brute-Force/">Brute Force</a><a class="tg" href="/tags/Center-Expand/">Center Expand</a></div></div></div><div class="box-item" id="post-List"><span class="ribbon"><a class=" externalLink" href="/tags/List/"><span class="ri">List</span></a></span><div class="box-body"><time datetime="2023-03-16T02:48:35.000Z">March 15th 2023</time><a class="post-link" href="/2023/03/15/LeetCode-19-Remove-Nth-Node-From-End-of-List/"><h2 class="post-title">LeetCode 19. Remove Nth Node From End of List</h2></a><a class="post-link" href="/2023/03/15/LeetCode-19-Remove-Nth-Node-From-End-of-List/"><p>Use two pointers, let them always have a distance of n, so when right pointer reach the end, the left pointer is the last nth no
45de.</p></a><div class="tags"><a class="tg" href="/tags/List/">List</a><a class="tg" href="/tags/Two-Pointers/">Two Pointers</a></div></div></div><div class="box-item" id="post-BFS"><span class="ribbon"><a class=" externalLink" href="/tags/BFS/"><span class="ri">BFS</span></a></span><div class="box-body"><time datetime="2023-03-15T23:42:04.000Z">March 15th 2023</time><a class="post-link" href="/2023/03/15/LeetCode-301-Remove-Invalid-Parentheses/"><h2 class="post-title">LeetCode 301. Remove Invalid Parentheses</h2></a><a class="post-link" href="/2023/03/15/LeetCode-301-Remove-Invalid-Parentheses/"><p>Using DFS method to check each possible remove.</p></a><div class="tags"><a class="tg" href="/tags/BFS/">BFS</a></div></div></div><div class="box-item" id="post-Math"><span class="ribbon"><a class=" externalLink" href="/tags/Math/"><span class="ri">Math</span></a></span><div class="box-body"><time datetime="2023-03-15T16:31:21.000Z">March 15th 2023</time><a class="post-link" href="/2023/03/15/LeetCode-279-Perfect-Squares/"><h2 class="post-title">LeetCode 279. Perfect Squares</h2></a><a class="post-link" href="/2023/03/15/LeetCode-279-Perfect-Squares/"><p>Every natural number can be represented as a sum of four non-negative integer squares. That is, the squares form an additive basis of order four</p></a><div class="tags"><a class="tg" href="/tags/Math/">Math</a><a class="tg" href="/tags/DP/">DP</a><a class="tg" href="/tags/Lagrange-Theorem/">Lagrange Theorem</a></div></div></div></div></div><nav id="pagination"><div class="pagination"><span class="page-number current">1</span><a class="page-number" href="/categories/ACM/page/2/">2</a><span class="space">…</span><a class="page-number" href="/categories/ACM/page/7/">7</a><a class="extend next" rel="next" href="/categories/ACM/page/2/"><i class="fas fa-angle-right"></i></a></div></nav></div></div><div id="bottom-outer"><div id="bottom-inner"><div id="incons"><a class="icon" href=" mailto:[email protected] " title="E-mail"><i class=" fas fa-fw fa-envelope"></i></a></div><div id="incons"><a class="icon" href=" " title="Wechat"><i class="fa-brands fa-weixin"></i></a></div><div id="incons"><a class="icon" href=" " title="X-Twitter"><i class="fa-brands fa-twitter"></i></a></div><div id="incons"><a class="icon" href=" " title="QQ"><i class="fa-brands fa-qq"></i></a></div><div id="incons"><a class="icon" href=" " title="Pinterest"><i class="fa-brands fa-pinterest-p"></i></a></div><div id="incons"><a class="icon" href=" https://www.linkedin.com/in/yaogu0304/" title="Linkedin"><i class="fa-brands fa-linkedin-in"></i></a></div><div id="incons"><a class="icon" href=" https://github.com/DyingDown " title="GitHub"><i class="fa-brands fa-github"></i></a></div><div id="incons"><a class="icon" href=" " title="Facebook"><i class="fa-brands fa-facebook-f"></i></a></div><div id="incons"><a class="icon" href=" https://www.instagram.com/o_oyao0304/" title="Instagram"><i class="fa-brands fa-instagram"></i></a></div><div id="incons"><a class="icon" href=" " title="TikTok"><i class="fa-brands fa-tiktok"></i></a></div><div id="author"><a id="theme_name" target="_blank" rel="noopener" href="https://github.com/DyingDown/hexo-theme-last"><svg version="1.0" xmlns="http://www.w3.org/2000/svg" width="900.000000pt" height="288.000000pt" viewBox="0 0 900.000000 288.000000" preserveAspectRatio="xMidYMid meet" id="last-icon"> 46<g transform="translate(0.000000,288.000000) scale(0.100000,-0.100000)" stroke="none"> 47<path class="blue a right" d="M3815 2435 c-45 -12 -134 -28 -220 -41 -16 -2 -64 -11 -105 -19 -41 -8 -96 -17 -122 -20 -45 -6 -48 -8 -48 -34 0 -16 13 -59 29 -97 16 -38 39 -94 51 -124 11 -30 25 -64 29 -75 5 -11 16 -40 26 -65 9 -25 23 -58 30 -75 7 -16 20 -50 30 -75 9 -25 23 -58 30 -75 7 -16 20 -50 30 -75 9 -25 23 -58 30 -75 7 -16 20 -50 30 -75 9 -25 23 -58 30 -75 7 -16 20 -50 30 -75 9 -25 23 -58 31 -73 8 -16 14 -33 14 -39 0 -5 6 -24 14 -41 20 -48 44 -110 51 -132 3 -11 12 -28 19 -38 13 -17 17 -17 60 -3 25 9 54 20 63 25 10 5 38 17 63 26 25 9 59 23 75 30 17 7 52 21 79 32 26 10 50 24 53 30 3 7 -2 39 -11 70 -10 32 -23 81 -30 108 -19 70 -41 151 -59 215 -9 30 -23 84 -32 120 -9 36 -23 89 -31 118 -8 28 -21 77 -29 107 -44 165 -64 239 -88 325 -9 30 -23 84 -32 120 -10 36 -19 71 -21 78 -4 14 -5 14 -69 -3z"/> 48<path class="yellow s left" d="M4247 2443 c-14 -4 -17 -11 -13 -28 3 -13 10 -270 16 -572 5 -301 13 -577 16 -611 4 -35 9 -240 13 -455 l6 -392 58 -3 c32 -2 108 4 170 12 61 9 135 16 164 16 29 0 99 6 155 14 57 8 148 17 203 21 112 6 157 15 163 33 2 6 -9 14 -25 18 -74 19 -217 134 -271 219 -74 117 -116 259 -110 375 l3 65 265 0 265 0 6 -60 c13 -119 78 -198 172 -210 142 -18 240 78 223 219 -6 57 -44 103 -111 137 -22 11 -47 24 -55 28 -17 10 -79 38 -125 57 -16 6 -48 20 -70 30 -22 9 -53 23 -70 30 -143 61 -252 131 -323 209 -28 31 -58 68 -66 83 -39 73 -54 114 -71 195 -17 83 -17 91 -1 175 10 48 24
48101 31 117 8 17 16 37 19 45 6 16 28 52 36 60 3 3 21 25 39 48 43 55 38 59 -88 66 -53 4 -148 13 -211 21 -63 9 -140 15 -171 15 -30 0 -82 5 -115 10 -90 16 -107 17 -127 13z"/> 49<path class="pink t" d="M8655 2428 c-22 -5 -71 -15 -110 -23 -38 -7 -104 -20 -145 -29 -114 -23 -231 -45 -274 -51 -70 -11 -26 -20 127 -25 l152 -5 3 -179 c2 -121 -1 -183 -9 -192 -8 -10 -51 -14 -168 -16 l-156 -3 -3 -645 c-1 -354 -6 -648 -11 -653 -6 -6 -277 -11 -408 -7 -10 0 -13 141 -15 653 l-3 652 -160 3 c-112 2 -161 6 -167 15 -4 6 -8 60 -8 120 l0 107 -27 0 c-15 0 -52 -6 -82 -14 -72 -18 -164 -37 -221 -45 -54 -7 -59 -24 -37 -104 23 -81 38 -139 46 -182 5 -22 14 -62 21 -90 7 -27 18 -72 25 -100 7 -27 18 -70 25 -95 6 -25 15 -63 19 -85 4 -22 12 -56 18 -75 6 -19 17 -57 23 -85 7 -27 19 -77 26 -110 8 -33 18 -78 23 -100 4 -22 12 -56 18 -75 12 -36 30 -108 43 -170 12 -55 30 -131 45 -185 8 -27 17 -67 20 -87 3 -22 14 -42 25 -48 10 -6 65 -15 122 -20 57 -6 144 -16 193 -22 50 -6 135 -14 190 -18 120 -10 277 -26 440 -45 148 -19 219 -19 233 -2 6 7 16 62 21 122 11 108 21 197 43 345 5 41 14 113 18 160 5 47 13 123 20 170 6 47 18 139 26 205 8 66 19 154 25 195 6 41 15 113 19 160 8 87 20 178 46 356 7 56 14 119 14 140 0 22 6 71 14 111 7 40 11 75 8 78 -7 7 -38 5 -87 -7z"/> 50<path class="yellow l right" d="M1215 2334 c-63 -53 -115 -100 -115 -105 0 -5 39 -9 86 -9 139 0 124 70 124 -595 l0 -575 204 0 c112 0 211 -3 220 -6 12 -5 16 -21 16 -75 0 -81 7 -85 65 -31 23 20 92 82 155 137 169 146 155 132 139 151 -7 9 -18 24 -24 35 -11 19 -88 143 -117 188 -9 14 -23 36 -30 48 -47 80 -102 169 -108 173 -4 3 -10 12 -13 20 -4 8 -15 27 -25 42 -9 15 -37 60 -61 100 -24 40 -47 75 -51 78 -4 3 -10 12 -13 20 -4 8 -15 27 -25 42 -9 15 -37 60 -61 100 -24 40 -47 75 -51 78 -4 3 -10 12 -13 20 -4 8 -15 27 -25 42 -9 15 -43 70 -75 122 -32 53 -64 96 -72 96 -8 0 -66 -43 -130 -96z"/> 51<path class="blue a right" d="M2815 2255 c-51 -13 -144 -30 -246 -45 -31 -4 -79 -12 -105 -18 -84 -18 -166 -33 -239 -43 -101 -13 -101 -13 -87 -166 7 -71 12 -171 12 -223 1 -52 5 -142 10 -200 5 -58 14 -207 20 -333 5 -125 14 -267 20 -315 5 -48 10 -134 10 -192 1 -148 16 -320 29 -333 7 -7 20 -6 46 6 45 22 88 40 145 62 25 9 59 23 75 30 17 7 50 20 75 30 25 9 59 23 75 30 17 7 50 20 75 30 25 9 59 23 75 30 17 7 50 20 75 30 25 9 59 23 75 30 17 7 50 20 75 30 25 9 59 23 75 30 17 7 50 20 75 30 25 9 58 23 73 31 16 8 33 14 39 14 5 0 24 6 41 14 18 7 57 23 87 35 84 34 91 37 150 64 l55 26 -76 1 c-50 0 -80 5 -87 13 -6 7 -22 48 -37 92 -14 43 -31 83 -38 87 -6 4 -117 8 -245 8 l-232 0 -19 -42 c-42 -95 -51 -119 -51 -133 0 -23 -32 -26 -215 -23 -190 3 -193 5 -161 73 9 18 16 38 16 43 0 6 6 23 14 39 16 32 26 55 57 133 11 30 27 69 34 85 7 17 21 50 30 75 10 25 23 59 30 75 7 17 21 50 30 75 10 25 23 59 30 75 7 17 21 50 30 75 10 25 23 59 30 75 7 17 21 50 30 75 10 25 23 59 30 75 8 17 28 66 45 110 18 44 38 94 45 110 7 17 20 47 29 68 26 60 22 67 -31 66 -27 0 -70 -7 -98 -14z"/> 52<path class="yellow s right" d="M6180 2246 c0 -9 4 -24 9 -34 36 -69 69 -246 49 -269 -8 -11 -65 -13 -260 -11 l-250 3 -22 55 c-40 106 -72 130 -170 130 -114 0 -176 -57 -176 -164 0 -91 45 -123 400 -289 120 -55 168 -81 240 -128 62 -40 120 -95 165 -154 76 -101 95 -167 95 -330 0 -163 -21 -236 -100 -350 -49 -71 -49 -71 -110 -122 l-55 -46 65 7 c36 3 126 11 200 16 74 6 159 14 189 20 30 5 82 10 115 10 34 1 122 9 196 19 l135 17 -3 135 c-1 74 -9 224 -17 334 -22 303 -35 511 -45 715 -10 202 -27 371 -39 383 -4 4 -69 12 -145 17 -75 5 -140 11 -145 14 -4 3 -70 10 -147 15 -77 5 -147 13 -157 17 -12 4 -17 1 -17 -10z"/> 53<path class="yellow l left" d="M854 2034 c-16 -14 -60 -51 -99 -82 -38 -31 -86 -71 -105 -88 -19 -18 -60 -51 -90 -75 -51 -40 -88 -70 -114 -94 -6 -6 -36 -30 -66 -55 -30 -25 -60 -49 -66 -55 -6 -5 -42 -35 -79 -65 -37 -30 -82 -68 -99 -83 l-31 -28 120 -116 c66 -64 232 -224 370 -357 324 -313 474 -457 495 -476 9 -8 33 -30 53 -49 l36 -34 28 23 c24 19 62 52 194 171 14 13 52 46 83 73 32 27 54 52 49 57 -5 5 -146 10 -313 11 l-305 3 -3 673 c-2 732 1 698 -58 646z"/> 54<path class="blue a middle" d="M3142 1880 c-5 -14 -15 -43 -21 -65 -7 -22 -17 -53 -23 -70 -5 -16 -14 -46 -18 -65 -8 -33 -16 -59 -41 -132 -19 -55 -23 -108 -8 -108 97 -3 252 0 257 5 3 3 0 20 -7 38 -7 18 -16 48 -21 67 -4 19 -12 46 -17 60 -6 14 -18 52 -28 85 -9 33 -23 78 -31 100 -8 23 -14 50 -14 60 0 11 -4 27 -10 35 -7 12 -11 10 -18 -10z"/> 55</g> 56</svg></a><span> made with </span><span id="heart">â¤ï¸</span><span> by </span><a id="theme_author" href="http://dyingdown.github.io">o_oyao</a><br><span>©o_oyao 2019-2026</span></div><br>
56<script async src="https://busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js" onerror="this.onerror=null;this.src='https://cdn.jsdelivr.net/gh/bchiang7/busuanzi@gh-pages/bsz.pure.mini.js'"></script>
56<span class="visits" id="busuanzi_container_site_pv"><div class="visits"><i class="fa fa-user"></i> <span id="busuanzi_value_site_uv"></span> | <i class="fa fa-fw fa-eye"></i> <span id="busuanzi_value_page_pv"></span></div></span></div></div>
56<script src="/js/third-party/tools.js"></script>
56<script src="/js/third-party/multi-search.js"></script>
56<script src="/js/Message.js"></script>
56<script src="/js/last.js"></script>
56<script src="/js/fitness.js"></script>
56<script src="/js/third-party/social-share.js"></script>
56<script src="/js/third-party/qrcode.js"></script>
56<script src="/js/third-party/tools.js"></script>
56<script src="/js/third-party/clipboard.js"></script>
56<script src="https://use.typekit.net/bkt6ydm.js"></script>
56</body></html>
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.