Merge pull request #419 from LetMeFly666/3038

添加问题“3038.相同分数的最大操作数目I”的代码和题解

Author: LetMeFly666

Codes/3038-maximum-number-of-operations-with-the-same-score-i.cpp

@@ -0,0 +1,24 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-06-07 20:19:32
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-06-07 20:21:19
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int maxOperations(vector<int>& nums) {
+        int ans = 1;
+        int val = nums[0] + nums[1];
+        for (int i = 2; i + 1< nums.size(); i += 2) {
+            if (nums[i] + nums[i + 1] != val) {
+                break;
+            }
+            ans++;
+        }
+        return ans;
+    }
+};

Codes/3038-maximum-number-of-operations-with-the-same-score-i.go

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-06-07 20:24:47
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-06-07 20:25:52
+ */
+package main
+
+func maxOperations(nums []int) int {
+    ans := 1
+    val := nums[0] + nums[1]
+    for i := 2; i < len(nums)-1; i += 2 {
+        if nums[i]+nums[i+1] != val {
+            break
+        }
+        ans++
+    }
+    return ans
+}

Codes/3038-maximum-number-of-operations-with-the-same-score-i.java

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2024-06-07 20:23:10
+ * @LastEditors: LetMeFly
+ * @LastEditTime: 2024-06-07 20:24:19
+ */
+class Solution {
+    public int maxOperations(int[] nums) {
+        int ans = 1;
+        int val = nums[0] + nums[1];
+        for (int i = 2; i < nums.length - 1; i += 2) {
+            if (nums[i] + nums[i + 1] != val) {
+                break;
+            }
+            ans++;
+        }
+        return ans;
+    }
+}

Codes/3038-maximum-number-of-operations-with-the-same-score-i.py

@@ -0,0 +1,17 @@
+'''
+Author: LetMeFly
+Date: 2024-06-07 20:21:40
+LastEditors: LetMeFly
+LastEditTime: 2024-06-07 20:22:25
+'''
+from typing import List
+
+class Solution:
+    def maxOperations(self, nums: List[int]) -> int:
+        ans = 1
+        val = nums[0] + nums[1]
+        for i in range(2, len(nums) - 1, 2):
+            if nums[i] + nums[i + 1] != val:
+                break
+            ans += 1
+        return ans

README.md

@@ -623,6 +623,7 @@
 |2960.统计已测试设备|简单|<a href="https://leetcode.cn/problems/count-tested-devices-after-test-operations/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/10/LeetCode%202960.%E7%BB%9F%E8%AE%A1%E5%B7%B2%E6%B5%8B%E8%AF%95%E8%AE%BE%E5%A4%87/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/138672383" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-tested-devices-after-test-operations/solutions/2772739/letmefly-2960tong-ji-yi-ce-shi-she-bei-k-59qt/" target="_blank">LeetCode题解</a>|
 |2965.找出缺失和重复的数字|简单|<a href="https://leetcode.cn/problems/find-missing-and-repeated-values/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/31/LeetCode%202965.%E6%89%BE%E5%87%BA%E7%BC%BA%E5%A4%B1%E5%92%8C%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139357662" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-missing-and-repeated-values/solutions/2796819/letmefly-2965zhao-chu-que-shi-he-zhong-f-p2rn/" target="_blank">LeetCode题解</a>|
 |2982.找出出现至少三次的最长特殊子字符串II|中等|<a href="https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-ii/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/30/LeetCode%202982.%E6%89%BE%E5%87%BA%E5%87%BA%E7%8E%B0%E8%87%B3%E5%B0%91%E4%B8%89%E6%AC%A1%E7%9A%84%E6%9C%80%E9%95%BF%E7%89%B9%E6%AE%8A%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139334864" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-ii/solutions/2795996/letmefly-2982zhao-chu-chu-xian-zhi-shao-9ubg1/" target="_blank">LeetCode题解</a>|
+|3038.相同分数的最大操作数目I|简单|<a href="https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-i/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/06/07/LeetCode%203038.%E7%9B%B8%E5%90%8C%E5%88%86%E6%95%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E6%93%8D%E4%BD%9C%E6%95%B0%E7%9B%AEI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139535702" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-i/solutions/2804245/letmefly-3038xiang-tong-fen-shu-de-zui-d-dkj7/" target="_blank">LeetCode题解</a>|
 |3067.在带权树网络中统计可连接服务器对数目|中等|<a href="https://leetcode.cn/problems/count-pairs-of-connectable-servers-in-a-weighted-tree-network/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/06/04/LeetCode%203067.%E5%9C%A8%E5%B8%A6%E6%9D%83%E6%A0%91%E7%BD%91%E7%BB%9C%E4%B8%AD%E7%BB%9F%E8%AE%A1%E5%8F%AF%E8%BF%9E%E6%8E%A5%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%AF%B9%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139456087" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-pairs-of-connectable-servers-in-a-weighted-tree-network/solutions/2801125/letmefly-3067zai-dai-quan-shu-wang-luo-z-zf2j/" 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 3038.相同分数的最大操作数目I.md

@@ -0,0 +1,148 @@
+---
+title: 3038.相同分数的最大操作数目 I
+date: 2024-06-07 20:49:43
+tags: [题解, LeetCode, 简单, 数组, 模拟]
+---
+
+# 【LetMeFly】3038.相同分数的最大操作数目 I
+
+力扣题目链接：[https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-i/](https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-i/)
+
+<p>给你一个整数数组&nbsp;<code>nums</code>&nbsp;，如果&nbsp;<code>nums</code>&nbsp;<strong>至少</strong>&nbsp;包含&nbsp;<code>2</code>&nbsp;个元素，你可以执行以下操作：</p>
+
+<ul>
+	<li>选择 <code>nums</code>&nbsp;中的前两个元素并将它们删除。</li>
+</ul>
+
+<p>一次操作的 <strong>分数</strong>&nbsp;是被删除元素的和。</p>
+
+<p>在确保<strong>&nbsp;所有操作分数相同</strong>&nbsp;的前提下，请你求出 <strong>最多</strong>&nbsp;能进行多少次操作。</p>
+
+<p>请你返回按照上述要求 <strong>最多</strong>&nbsp;可以进行的操作次数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<pre>
+<b>输入：</b>nums = [3,2,1,4,5]
+<b>输出：</b>2
+<b>解释：</b>我们执行以下操作：
+- 删除前两个元素，分数为 3 + 2 = 5 ，nums = [1,4,5] 。
+- 删除前两个元素，分数为 1 + 4 = 5 ，nums = [5] 。
+由于只剩下 1 个元素，我们无法继续进行任何操作。</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<b>输入：</b>nums = [3,2,6,1,4]
+<b>输出：</b>1
+<b>解释：</b>我们执行以下操作：
+- 删除前两个元素，分数为 3 + 2 = 5 ，nums = [6,1,4] 。
+由于下一次操作的分数与前一次不相等，我们无法继续进行任何操作。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>2 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
+</ul>
+
+
+    
+## 解题方法：遍历模拟
+
+首先记录$nums[0] + nums[1]的值$（记为$val$），接着从下标$2$开始遍历数组（遍历时$i$每次＋2），如果相邻两个元素之和为$val$，则答案加一且遍历继续；否则遍历结束。
+
++ 时间复杂度$O(len(nums))$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+class Solution {
+public:
+    int maxOperations(vector<int>& nums) {
+        int ans = 1;
+        int val = nums[0] + nums[1];
+        for (int i = 2; i + 1< nums.size(); i += 2) {
+            if (nums[i] + nums[i + 1] != val) {
+                break;
+            }
+            ans++;
+        }
+        return ans;
+    }
+};
+```
+
+#### Go
+
+```go
+// package main
+
+func maxOperations(nums []int) int {
+    ans := 1
+    val := nums[0] + nums[1]
+    for i := 2; i < len(nums)-1; i += 2 {
+        if nums[i]+nums[i+1] != val {
+            break
+        }
+        ans++
+    }
+    return ans
+}
+```
+
+#### Java
+
+```java
+class Solution {
+    public int maxOperations(int[] nums) {
+        int ans = 1;
+        int val = nums[0] + nums[1];
+        for (int i = 2; i < nums.length - 1; i += 2) {
+            if (nums[i] + nums[i + 1] != val) {
+                break;
+            }
+            ans++;
+        }
+        return ans;
+    }
+}
+```
+
+#### Python
+
+```python
+# from typing import List
+
+class Solution:
+    def maxOperations(self, nums: List[int]) -> int:
+        ans = 1
+        val = nums[0] + nums[1]
+        for i in range(2, len(nums) - 1, 2):
+            if nums[i] + nums[i + 1] != val:
+                break
+            ans += 1
+        return ans
+```
+
+## End
+
+这是在486/1920(px)宽度屏幕下写的题解。这是为什么呢？
+
+```base64
+5LuK5aSp5byA5aeL56uv5Y2I5pS+5YGH77yM5LqO5piv5bCx5pyJ5LqG5piO5pel6KaB5a6M5oiQ55qE56CU56m2546w54q25ZKM5LiL5LiL5ZGo5LqM6KaB5a6M5oiQ55qE5oqA5pyv6Lev57q/44CC44GE44GE44KT44GY44KD44Gq44GE44GLRG9nZSjotoXlpKfniYgpCg==
+```
+
+还是白色背景的VsCode和Word比较像。
+
+> 同步发文于CSDN和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2024/06/07/LeetCode%203038.%E7%9B%B8%E5%90%8C%E5%88%86%E6%95%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E6%93%8D%E4%BD%9C%E6%95%B0%E7%9B%AEI/)哦~
+>
+> Tisfy：[https://letmefly.blog.csdn.net/article/details/139535702](https://letmefly.blog.csdn.net/article/details/139535702)

Solutions/Other-Japanese-LearningNotes.md

@@ -358,6 +358,8 @@ xx型
 |東京(とうきょう)|东京|
 |大阪(おおさか)|大阪|
 |京都(きょうと)|京都|
+|遠く(とおく)|远方|
+|近く(ちかく)|附近|
 |||
 |な|名|
 |えい|英|
@@ -560,6 +562,7 @@ xx型
 |スポーツはあまり好きではありません。<br/>不怎么喜欢运动。|
 |マリアに電話をかけます。<br/>给玛丽亚打电话。|
 |31時間はたらきました。<br/>工作了31个小时。|
+|何か描きましょう。<br/>画点什么吧。|
 
 
 <span style="background-color:#ffbd2a; color: white">TODO:</span> 实词用<font color="#28bea0">-</font>色助词用<font color="#ce82ff">-</font>色。