Skip to content

Commit 6f4e218

Browse files
LetMeFly666LetMeFly666
committed
update: 添加问题“3074.重新分装苹果”的代码和题解 (#1278) 3074: AC.cpp (#1277) cpp - AC,100.00%,40.99% py - AC,100.00%,95.91% go - AC,100.00%,29.55% java - AC,39.52%,43.15% rust - AC,100.00%,11.11%
dedb92e
1 parent fa8e84d commit 6f4e218

File tree

2,923 files changed

+29109
-25393
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

2,923 files changed

+29109
-25393
lines changed

‎2022/03/03/LeetCode 0564.寻找最近的回文数/index.html‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@
2626
<meta property="og:description" content="力扣题目链接：https:&#x2F;&#x2F;leetcode-cn.com&#x2F;problems&#x2F;find-the-closest-palindrome&#x2F; 给定一个表示整数的字符串 $n$ ，返回与它最近的回文整数（不包括自身）。如果不止一个，返回较小的那个。 “最近的”定义为两个整数差的绝对值最小。 示例 1: 12输入: n &#x3D; &quot;123&quot;输出: &quot;121&quot; 示例 2:">
2727
<meta property="og:locale" content="zh_CN">
2828
<meta property="article:published_time" content="2022-03-03T06:53:21.000Z">
29-
<meta property="article:modified_time" content="2025-12-23T16:03:48.181Z">
29+
<meta property="article:modified_time" content="2025-12-24T10:57:47.138Z">
3030
<meta property="article:author" content="&lt;a href&#x3D;&quot;https:&#x2F;&#x2F;letmefly.xyz&quot;&gt;Tisfy&lt;&#x2F;a&gt;">
3131
<meta property="article:tag" content="LeetCode">
3232
<meta property="article:tag" content="困难">

‎2022/05/21/LeetCode 0961.在长度2N的数组中找出重复N次的元素/index.html‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@
2626
<meta property="og:description" content="【LetMeFly】四种方式解决 961.在长度2N的数组中找出重复N次的元素力扣题目链接：https:&#x2F;&#x2F;leetcode.cn&#x2F;problems&#x2F;n-repeated-element-in-size-2n-array&#x2F; 给你一个整数数组 $nums$ ，该数组具有以下属性： $nums.length &#x3D;&#x3D; 2 * n$. $nums$ 包含 $n + 1$ 个 不同的 元">
2727
<meta property="og:locale" content="zh_CN">
2828
<meta property="article:published_time" content="2022-05-21T02:31:00.000Z">
29-
<meta property="article:modified_time" content="2025-12-23T16:03:48.183Z">
29+
<meta property="article:modified_time" content="2025-12-24T10:57:47.143Z">
3030
<meta property="article:author" content="&lt;a href&#x3D;&quot;https:&#x2F;&#x2F;letmefly.xyz&quot;&gt;Tisfy&lt;&#x2F;a&gt;">
3131
<meta property="article:tag" content="LeetCode">
3232
<meta property="article:tag" content="Rand">

‎2022/05/25/LeetCode 0049.字母异位词分组/index.html‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@
2626
<meta property="og:description" content="【LetMeFly】49.字母异位词分组力扣题目链接：https:&#x2F;&#x2F;leetcode.cn&#x2F;problems&#x2F;group-anagrams&#x2F; 给你一个字符串数组，请你将字母异位词组合在一起。可以按任意顺序返回结果列表。 字母异位词是由重新排列源单词的字母得到的一个新单词，所有源单词中的字母通常恰好只用一次。 示例 1: 12输入: strs &#x3D; [&quot;eat&quot;, &quot;t">
2727
<meta property="og:locale" content="zh_CN">
2828
<meta property="article:published_time" content="2022-05-25T11:29:07.000Z">
29-
<meta property="article:modified_time" content="2025-12-23T16:03:48.178Z">
29+
<meta property="article:modified_time" content="2025-12-24T10:57:47.132Z">
3030
<meta property="article:author" content="&lt;a href&#x3D;&quot;https:&#x2F;&#x2F;letmefly.xyz&quot;&gt;Tisfy&lt;&#x2F;a&gt;">
3131
<meta property="article:tag" content="LeetCode">
3232
<meta property="article:tag" content="中等">

‎2022/05/25/LeetCode 0050.Pow(x, n)/index.html‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@
2626
<meta property="og:description" content="【LetMeFly】50.Pow(x, n)实现 pow(x, n) ，即计算x的n次幂函数（即，xⁿ ）。 示例 1: 12输入：x &#x3D; 2.00000, n &#x3D; 10输出：1024.00000 示例 2: 12输入：x &#x3D; 2.10000, n &#x3D; 3输出：9.26100 示例 3: 123输入：x &#x3D; 2.00000, n &#x3D; -2输出：0.25000解释：2-2 &#x3D; 1&#x2F;22 &#x3D; 1&#x2F;">
2727
<meta property="og:locale" content="zh_CN">
2828
<meta property="article:published_time" content="2022-05-25T11:48:49.000Z">
29-
<meta property="article:modified_time" content="2025-12-23T16:03:48.178Z">
29+
<meta property="article:modified_time" content="2025-12-24T10:57:47.132Z">
3030
<meta property="article:author" content="&lt;a href&#x3D;&quot;https:&#x2F;&#x2F;letmefly.xyz&quot;&gt;Tisfy&lt;&#x2F;a&gt;">
3131
<meta property="article:tag" content="LeetCode">
3232
<meta property="article:tag" content="中等">

‎2022/05/25/LeetCode 0467.环绕字符串中唯一的子字符串/index.html‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@
2626
<meta property="og:description" content="【LetMeFly】467.环绕字符串中唯一的子字符串力扣题目链接：https:&#x2F;&#x2F;leetcode.cn&#x2F;problems&#x2F;unique-substrings-in-wraparound-string&#x2F; 把字符串s看作是“abcdefghijklmnopqrstuvwxyz”的无限环绕字符串，所以s看起来是这样的： .1234567现在给定另一个字符串&#96;&#96;&#96;p&#96;&#96;&#96;。返回&#96;&#96;&#96;s&#96;&#96;&#96;中 **">
2727
<meta property="og:locale" content="zh_CN">
2828
<meta property="article:published_time" content="2022-05-25T05:45:46.000Z">
29-
<meta property="article:modified_time" content="2025-12-23T16:03:48.181Z">
29+
<meta property="article:modified_time" content="2025-12-24T10:57:47.137Z">
3030
<meta property="article:author" content="&lt;a href&#x3D;&quot;https:&#x2F;&#x2F;letmefly.xyz&quot;&gt;Tisfy&lt;&#x2F;a&gt;">
3131
<meta property="article:tag" content="DP">
3232
<meta property="article:tag" content="LeetCode">

‎2022/05/26/LeetCode 0699.掉落的方块/index.html‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@
2626
<meta property="og:description" content="【LetMeFly】两种方法解决 699.掉落的方块力扣题目链接：https:&#x2F;&#x2F;leetcode.cn&#x2F;problems&#x2F;falling-squares&#x2F; 在无限长的数轴（即x轴）上，我们根据给定的顺序放置对应的正方形方块。 第i个掉落的方块（positions[i] &#x3D; (left, side_length)）是正方形，其中 left 表示该方块最左边的点位置(positions[i][0])">
2727
<meta property="og:locale" content="zh_CN">
2828
<meta property="article:published_time" content="2022-05-26T01:10:06.000Z">
29-
<meta property="article:modified_time" content="2025-12-23T16:03:48.182Z">
29+
<meta property="article:modified_time" content="2025-12-24T10:57:47.139Z">
3030
<meta property="article:author" content="&lt;a href&#x3D;&quot;https:&#x2F;&#x2F;letmefly.xyz&quot;&gt;Tisfy&lt;&#x2F;a&gt;">
3131
<meta property="article:tag" content="LeetCode">
3232
<meta property="article:tag" content="困难">

‎2022/05/27/LeetCode 0051.N皇后/index.html‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@
2727
<meta property="og:locale" content="zh_CN">
2828
<meta property="og:image" content="https://assets.leetcode.com/uploads/2020/11/13/queens.jpg">
2929
<meta property="article:published_time" content="2022-05-27T02:25:01.000Z">
30-
<meta property="article:modified_time" content="2025-12-23T16:03:48.178Z">
30+
<meta property="article:modified_time" content="2025-12-24T10:57:47.132Z">
3131
<meta property="article:author" content="&lt;a href&#x3D;&quot;https:&#x2F;&#x2F;letmefly.xyz&quot;&gt;Tisfy&lt;&#x2F;a&gt;">
3232
<meta property="article:tag" content="LeetCode">
3333
<meta property="article:tag" content="N皇后">
@@ -370,10 +370,10 @@ <h3 id="AC代码"><a href="#AC代码" class="headerlink" title="AC代码"></a>AC
370370

371371
<a href="/tags/LeetCode/">#LeetCode</a>
372372

373-
<a href="/tags/%E5%9B%B0%E9%9A%BE/">#困难</a>
374-
375373
<a href="/tags/%E5%9B%9E%E6%BA%AF/">#回溯</a>
376374

375+
<a href="/tags/%E5%9B%B0%E9%9A%BE/">#困难</a>
376+
377377
<a href="/tags/N%E7%9A%87%E5%90%8E/">#N皇后</a>
378378

379379
</div>

‎2022/05/27/LeetCode 0052.N皇后II/index.html‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@
2727
<meta property="og:locale" content="zh_CN">
2828
<meta property="og:image" content="https://assets.leetcode.com/uploads/2020/11/13/queens.jpg">
2929
<meta property="article:published_time" content="2022-05-27T02:50:29.000Z">
30-
<meta property="article:modified_time" content="2025-12-23T16:03:48.178Z">
30+
<meta property="article:modified_time" content="2025-12-24T10:57:47.132Z">
3131
<meta property="article:author" content="&lt;a href&#x3D;&quot;https:&#x2F;&#x2F;letmefly.xyz&quot;&gt;Tisfy&lt;&#x2F;a&gt;">
3232
<meta property="article:tag" content="LeetCode">
3333
<meta property="article:tag" content="N皇后">
@@ -371,10 +371,10 @@ <h4 id="Java"><a href="#Java" class="headerlink" title="Java"></a>Java</h4><p>
371371

372372
<a href="/tags/LeetCode/">#LeetCode</a>
373373

374-
<a href="/tags/%E5%9B%B0%E9%9A%BE/">#困难</a>
375-
376374
<a href="/tags/%E5%9B%9E%E6%BA%AF/">#回溯</a>
377375

376+
<a href="/tags/%E5%9B%B0%E9%9A%BE/">#困难</a>
377+
378378
<a href="/tags/N%E7%9A%87%E5%90%8E/">#N皇后</a>
379379

380380
</div>

‎2022/05/27/LeetCode 面试题 17.11. 单词距离/index.html‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@
2626
<meta property="og:description" content="【LetMeFly】面试题17.11.单词距离 - 可直接应用到题目进阶力扣题目链接：https:&#x2F;&#x2F;leetcode.cn&#x2F;problems&#x2F;find-closest-lcci&#x2F; 有个内含单词的超大文本文件，给定任意两个不同的单词，找出在这个文件中这两个单词的最短距离(相隔单词数)。如果寻找过程在这个文件中会重复多次，而每次寻找的单词不同，你能对此优化吗? 示例 1: 12输入：words &#x3D;">
2727
<meta property="og:locale" content="zh_CN">
2828
<meta property="article:published_time" content="2022-05-27T01:54:36.000Z">
29-
<meta property="article:modified_time" content="2025-12-23T16:03:48.194Z">
29+
<meta property="article:modified_time" content="2025-12-24T10:57:47.166Z">
3030
<meta property="article:author" content="&lt;a href&#x3D;&quot;https:&#x2F;&#x2F;letmefly.xyz&quot;&gt;Tisfy&lt;&#x2F;a&gt;">
3131
<meta property="article:tag" content="LeetCode">
3232
<meta property="article:tag" content="中等">

‎2022/05/28/LeetCode 0054.螺旋矩阵/index.html‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -30,7 +30,7 @@
3030
<meta property="og:image" content="https://cors.tisfy.eu.org/https://img-blog.csdnimg.cn/img_convert/d4779e92cf8d4f868809aed3275b5e0e.png">
3131
<meta property="og:image" content="https://cors.tisfy.eu.org/https://img-blog.csdnimg.cn/img_convert/0d800546a60da3c09770990699a5c5f9.png">
3232
<meta property="article:published_time" content="2022-05-28T03:21:32.000Z">
33-
<meta property="article:modified_time" content="2025-12-23T16:03:48.178Z">
33+
<meta property="article:modified_time" content="2025-12-24T10:57:47.132Z">
3434
<meta property="article:author" content="&lt;a href&#x3D;&quot;https:&#x2F;&#x2F;letmefly.xyz&quot;&gt;Tisfy&lt;&#x2F;a&gt;">
3535
<meta property="article:tag" content="LeetCode">
3636
<meta property="article:tag" content="中等">

0 commit comments

Comments
 (0)