update: 添加问题“3392.统计符合条件长度为3的子数组数目”的代码和题解(#903)

Signed-off-by: LetMeFly666 <814114971@qq.com>

Author: LetMeFly666

Codes/3392-count-subarrays-of-length-three-with-a-condition.cpp

@@ -0,0 +1,20 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-27 23:47:30
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-27 23:48:38
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int countSubarrays(vector<int>& nums) {
+        int ans = 0;
+        for (int i = 2; i < nums.size(); i++) {
+            ans += (nums[i] + nums[i - 2]) * 2 == nums[i - 1];
+        }
+        return ans;
+    }
+};

Codes/3392-count-subarrays-of-length-three-with-a-condition.go

@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-27 23:49:15
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-27 23:52:54
+ * @Description: AC,100.00%,95.45%
+ */
+package main
+
+func countSubarrays(nums []int) (ans int) {
+    for i := 2; i < len(nums); i++ {
+        if (nums[i] + nums[i - 2]) * 2 == nums[i - 1] {
+            ans++
+        }
+    }
+    return
+}

Codes/3392-count-subarrays-of-length-three-with-a-condition.java

@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-27 23:49:11
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-27 23:50:25
+ */
+class Solution {
+    public int countSubarrays(int[] nums) {
+        int ans = 0;
+        for (int i = 2; i < nums.length; i++) {
+            if ((nums[i - 2] + nums[i]) * 2 == nums[i - 1]) {
+                ans++;
+            }
+        }
+        return ans;
+    }
+}

Codes/3392-count-subarrays-of-length-three-with-a-condition.py

@@ -0,0 +1,11 @@
+'''
+Author: LetMeFly
+Date: 2025-04-27 23:49:08
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-04-27 23:49:26
+'''
+from typing import List
+
+class Solution:
+    def countSubarrays(self, nums: List[int]) -> int:
+        return sum((nums[i - 2] + nums[i]) * 2 == nums[i - 1] for i in range(2, len(nums)))

README.md

@@ -955,6 +955,7 @@
 |3306.元音辅音字符串计数II|中等|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/13/LeetCode%203306.%E5%85%83%E9%9F%B3%E8%BE%85%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%AE%A1%E6%95%B0II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146228751" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/solutions/3609545/letmefly-3306yuan-yin-fu-yin-zi-fu-chuan-7y2q/" target="_blank">LeetCode题解</a>|
 |3340.检查平衡字符串|简单|<a href="https://leetcode.cn/problems/check-balanced-string/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/14/LeetCode%203340.%E6%A3%80%E6%9F%A5%E5%B9%B3%E8%A1%A1%E5%AD%97%E7%AC%A6%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146249653" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/check-balanced-string/solutions/3610899/letmefly-3340jian-cha-ping-heng-zi-fu-ch-p8eo/" target="_blank">LeetCode题解</a>|
 |3375.使数组的值全部为K的最少操作次数|简单|<a href="https://leetcode.cn/problems/minimum-operations-to-make-array-values-equal-to-k/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/09/LeetCode%203375.%E4%BD%BF%E6%95%B0%E7%BB%84%E7%9A%84%E5%80%BC%E5%85%A8%E9%83%A8%E4%B8%BAK%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147104288" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-operations-to-make-array-values-equal-to-k/solutions/3646138/letmefly-3375shi-shu-zu-de-zhi-quan-bu-w-i71e/" target="_blank">LeetCode题解</a>|
+|3392.统计符合条件长度为3的子数组数目|简单|<a href="https://leetcode.cn/problems/count-subarrays-of-length-three-with-a-condition/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/29/LeetCode%203392.%E7%BB%9F%E8%AE%A1%E7%AC%A6%E5%90%88%E6%9D%A1%E4%BB%B6%E9%95%BF%E5%BA%A6%E4%B8%BA3%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147603015" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-subarrays-of-length-three-with-a-condition/solutions/3665081/letmefly-3392tong-ji-fu-he-tiao-jian-cha-h935/" target="_blank">LeetCode题解</a>|
 |3396.使数组元素互不相同所需的最少操作次数|简单|<a href="https://leetcode.cn/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/08/LeetCode%203396.%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E4%BA%92%E4%B8%8D%E7%9B%B8%E5%90%8C%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147080178" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/solutions/3644951/letmefly-3396shi-shu-zu-yuan-su-hu-bu-xi-glg4/" target="_blank">LeetCode题解</a>|
 |剑指Offer0047.礼物的最大价值|简单|<a href="https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/03/08/LeetCode%20%E5%89%91%E6%8C%87%20Offer%2047.%20%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/129408765" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/solutions/2155672/letmefly-jian-zhi-offer-47li-wu-de-zui-d-rekb/" target="_blank">LeetCode题解</a>|
 |剑指OfferII0041.滑动窗口的平均值|简单|<a href="https://leetcode.cn/problems/qIsx9U/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/07/16/LeetCode%20%E5%89%91%E6%8C%87%20Offer%20II%200041.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E5%B9%B3%E5%9D%87%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/125819216" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/qIsx9U/solution/by-tisfy-30mq/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 3392.统计符合条件长度为3的子数组数目.md

@@ -0,0 +1,145 @@
+---
+title: 3392.统计符合条件长度为 3 的子数组数目：一次遍历模拟
+date: 2025-04-29 10:24:45
+tags: [题解, LeetCode, 简单, 数组]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】3392.统计符合条件长度为 3 的子数组数目：一次遍历模拟
+
+力扣题目链接：[https://leetcode.cn/problems/count-subarrays-of-length-three-with-a-condition/](https://leetcode.cn/problems/count-subarrays-of-length-three-with-a-condition/)
+
+<p>给你一个整数数组&nbsp;<code>nums</code>&nbsp;，请你返回长度为 3 的 <span data-keyword="subarray-nonempty">子数组</span>，满足第一个数和第三个数的和恰好为第二个数的一半。</p>
+
+<p><strong>子数组</strong>&nbsp;指的是一个数组中连续 <strong>非空</strong>&nbsp;的元素序列。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>nums = [1,2,1,4,1]</span></p>
+
+<p><span class="example-io"><b>输出：</b>1</span></p>
+
+<p><b>解释：</b></p>
+
+<p>只有子数组&nbsp;<code>[1,4,1]</code>&nbsp;包含 3 个元素且第一个和第三个数字之和是中间数字的一半。number.</p>
+</div>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>nums = [1,1,1]</span></p>
+
+<p><span class="example-io"><b>输出：</b>0</span></p>
+
+<p><b>解释：</b></p>
+
+<p><code>[1,1,1]</code>&nbsp;是唯一长度为 3 的子数组，但第一个数和第三个数的和不是第二个数的一半。</p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>3 &lt;= nums.length &lt;= 100</code></li>
+	<li><code><font face="monospace">-100 &lt;= nums[i] &lt;= 100</font></code></li>
+</ul>
+
+
+    
+## 解题方法：一次遍历模拟
+
+用变量$i$从第三个元素开始向后遍历数组，若$(nums[i] + nums[i - 2]) * 2 == nums[i - 1]$，则答案数量加一。
+
++ 时间复杂度$O(len(nums))$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-27 23:47:30
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-27 23:48:38
+ */
+class Solution {
+public:
+    int countSubarrays(vector<int>& nums) {
+        int ans = 0;
+        for (int i = 2; i < nums.size(); i++) {
+            ans += (nums[i] + nums[i - 2]) * 2 == nums[i - 1];
+        }
+        return ans;
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-04-27 23:49:08
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-04-27 23:49:26
+'''
+from typing import List
+
+class Solution:
+    def countSubarrays(self, nums: List[int]) -> int:
+        return sum((nums[i - 2] + nums[i]) * 2 == nums[i - 1] for i in range(2, len(nums)))
+```
+
+#### Golang
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-27 23:49:15
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-27 23:52:54
+ * @Description: AC,100.00%,95.45%
+ */
+package main
+
+func countSubarrays(nums []int) (ans int) {
+    for i := 2; i < len(nums); i++ {
+        if (nums[i] + nums[i - 2]) * 2 == nums[i - 1] {
+            ans++
+        }
+    }
+    return
+}
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-04-27 23:49:11
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-04-27 23:50:25
+ */
+class Solution {
+    public int countSubarrays(int[] nums) {
+        int ans = 0;
+        for (int i = 2; i < nums.length; i++) {
+            if ((nums[i - 2] + nums[i]) * 2 == nums[i - 1]) {
+                ans++;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/147603015)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/04/29/LeetCode%203392.%E7%BB%9F%E8%AE%A1%E7%AC%A6%E5%90%88%E6%9D%A1%E4%BB%B6%E9%95%BF%E5%BA%A6%E4%B8%BA3%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -676,7 +676,7 @@ categories: [自用]
 |<font color="#28bea0" title="二次复习">perturbed</font>|adj. 焦虑的，不安的，烦躁的<br/>v. 使焦虑，使不安|
 |garrison|n. 卫戍部队，守备不对，卫戍区，驻防地<br/>v. 驻防，派(兵)驻守|
 |woodpecker|n. 啄木鸟|
-|<font color="#28bea0" title="二次复习">cosmetics</font>|n. 化妆品|
+|<font color="#28bea0" title="三次复习">cosmetics</font>|n. 化妆品|
 |violet|n. 紫罗兰，紫罗兰色，蓝紫色<br/>adj. 紫罗兰色的|
 |stow|v. 妥善放置，把…收好|
 |presently|adv. 一会儿，不久，现在，目前<br/>Tisfy: 当下这个意思与currently类似|
@@ -876,7 +876,7 @@ categories: [自用]
 |butchery|n. 残杀，杀戮，屠宰工作|
 |||
 |secretariat|n. 秘书处，书记处|
-|<font color="#28bea0" title="二次复习">sheriff</font>|n. 县(郡)治安官|
+|<font color="#28bea0" title="三次复习">sheriff</font>|n. 县(郡)治安官|
 |inasmuch|adv. 由于，〈古〉只要<details><summary>例句</summary>Inasmuch as you are an adult, you must be responsible for your own behavior.<br/>因为你是一个成年人，你必须对自己的行为负责。</details>|
 |countenance|n. 面容，脸色，面部表情<br/>v. 支持，赞成，同意|
 |||
@@ -1115,6 +1115,12 @@ categories: [自用]
 |bottle-neck|n. 瓶颈，道路上的狭窄处|
 |||
 |perimeter|n. 周长，外缘，边缘|
+|||
+|luncheon|n. 午宴，正事的午餐|
+|voiceless|ajd. (语音)发清音的，无法出声的，无发言权的|
+|frying-pan|n. 煎锅，长柄平锅|
+|||
+|lining|n. 内衬，衬层，衬里|
 
 <p class="wordCounts">单词收录总数</p>
 

Solutions/Other-Japanese-LearningNotes.md

@@ -241,6 +241,8 @@ xx型
 |誕生日(たんじょうび)|生日|
 |別れ(わかれ)|分手/告别|
 |デート|约会|
+|喧嘩(けんか)|吵架|
+|遅(おくれ)|迟到|
 |||
 |話せ(はなせ)|会说|
 |住んで(すんで)|住|
@@ -333,6 +335,7 @@ xx型
 |長い(ながい)|长的|
 |短い(みじかい)|短的|
 |いい|好的（不错的）|
+|最悪(さいあく)|最糟糕的|
 |古い(ふるい)|旧的|
 |近い(ちかい)|近的|
 |遠い(とおい)|远的|
@@ -344,6 +347,7 @@ xx型
 |可愛い(かわいい)|可爱的|
 |うるさい|吵的|
 |綺麗(きれい)|漂亮的/干净的|
+|(ダサく)|土气的/不酷的|
 |難しい(むずかしい)|难的|
 |静か(しずか)|安静的|
 |にぎやか|热闹的|
@@ -893,6 +897,7 @@ xx型
 |違う(ちがう)|不对/不同|
 |素敵(すてき)|好/漂亮|
 |必ず(かならず)|一定|
+|今回(こんかい)|这次|
 |||
 |牛肉(ぎゅうにく)|牛肉|
 |豚肉(ぶたにく)|猪肉|