2025-02-18T13:28:49.055Z https://penciy.github.io/ 一只铅笔芯 Hexo https://penciy.github.io/posts/12368761/ 2024-08-11T09:25:15.000Z 2025-02-18T13:28:49.055Z

<p>JDK16之后限制了反射方式对于JDK内部类的访问，因此在使用高版本JDK运行较低版本的JDK时，某些依赖由于会发生错误。</p> <figure class="highlight java"><table><tr><td

https://penciy.github.io/posts/42749442322/ 2024-07-27T13:11:24.000Z 2025-02-18T13:00:38.863Z

<h4 id="题目">题目</h4> <p><a href="https://leetcode.cn/problems/find-subarray-with-bitwise-or-closest-to-k/description/">3171. 找到按位或最接近 K 的子数组

https://penciy.github.io/posts/4232312342/ 2024-07-22T07:01:24.000Z 2024-09-19T03:20:36.580Z

<h3 id="快速幂">快速幂</h3> <h4 id="递归求解">递归求解</h4> <p>快速幂实际是分治的思想，把大的次幂一步步除以二。例如求解<span class="katex"><span class="katex-mathml"><math

https://penciy.github.io/posts/321944572/ 2024-06-30T11:55:17.000Z 2024-09-19T03:19:36.133Z

<h3 id="前缀函数">前缀函数</h3> <h4 id="真-前缀-真-后缀">(真)前缀/(真)后缀</h4> <p><strong>前缀</strong><span class="katex"><span class="katex-mathml"><math

https://penciy.github.io/posts/11231445/ 2024-06-14T10:05:24.000Z 2024-09-19T03:20:06.306Z

<h4 id="差分">差分</h4> <h5 id="概念">概念</h5> <p>对于一个数组arr，如果要将长为m的区间内的所有元素增加

https://penciy.github.io/posts/qian_zhui_he/ 2024-06-05T07:25:11.000Z 2024-09-19T03:19:02.565Z

<h3 id="前缀和">前缀和</h3> <h4 id="定义">定义</h4> <p>前缀和可以简单理解为「数列的前 n 项的和」，可以O(1)地查询区间和，通常在数组不发生更新的情况下使用。</p> <h4 id="模板">模板</h4> <figure

https://penciy.github.io/posts/4274944572/ 2024-05-27T13:11:24.000Z 2024-09-19T03:17:13.208Z

<h4 id="线段树-数组实现">线段树（数组实现）</h4> <h5

https://penciy.github.io/posts/3215636925/ 2024-05-03T07:41:23.000Z 2024-06-05T11:44:24.035Z

<h4 id="定义">定义</h4> <p>设模数为m，对于一个整数a，如果存在另一个整数<span class="katex"><span class="katex-mathml"><math

https://penciy.github.io/posts/1828842990/ 2024-04-12T12:19:32.000Z 2024-06-05T12:04:55.325Z

<h3 id="强连通分量">强连通分量</h3> <h4 id="定义">定义</h4> <p><strong>强连通</strong>的定义是：有向图 G 强连通是指，G 中任意两个结点连通。<br> <strong>强连通分量</strong>（Strongly

https://penciy.github.io/posts/4274956372/ 2024-04-07T13:11:24.000Z 2024-09-19T03:07:29.833Z

<h3 id="树上倍增">树上倍增</h3> <p>模板：<a href="https://leetcode.cn/problems/kth-ancestor-of-a-tree-node/submissions/487128849/">1483. 树节点的第 K 个祖先 -

https://penciy.github.io/posts/3907716225/ 2024-04-03T11:51:33.000Z 2024-04-21T14:45:45.121Z

<h3 id="二分查找">二分查找</h3> <p>可以二分的前提：有序</p> <p>时间复杂度：O(log n)</p> <h4

https://penciy.github.io/posts/1243066710/ 2024-04-01T15:21:01.019Z 2024-04-19T13:16:49.520Z

<p>Welcome to <a href="https://hexo.io/">Hexo</a>! This is your very first post. Check <a href="https://hexo.io/docs/">documentation</a>