update: 添加问题“3201.找出有效子序列的最大长度I”的代码和题解(#1033)

* word: en

* merge: original dev and master by hand(cherry-pick) (#1030)

* merge: original dev and master by hand(cherry-pick) (#1030)

* 3201: AC.cpp (#1030)

AC,69.57%,84.78%

* hello: #1032 (#1030)

* 3201: WA.py (#1030)

* 3201: AC.py (#1030)

AC,100.00%,91.67%

* 3201: AC.java+go (#1030)

java - AC,80.00%,75.00%
go - AC,72.73%,72.73%

* update: 添加问题“3201.找出有效子序列的最大长度I”的代码和题解(#1033)

Signed-off-by: LetMeFly666 <[email protected]>

* typo: Update Solutions/LeetCode 3201.找出有效子序列的最大长度I.md

Co-authored-by: Copilot <[email protected]>

* x->n: Update Solutions/LeetCode 3201.找出有效子序列的最大长度I.md

Co-authored-by: Copilot <[email protected]>

* docs: 题目中没有说明n=len(nums)

---------

Signed-off-by: LetMeFly666 <[email protected]>
Co-authored-by: Copilot <[email protected]>

Author: LetMeFly666

.commitmsg

@@ -1,6 +1,34 @@
-PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git branch -d dev
-error: The branch 'dev' is not fully merged.
-If you are sure you want to delete it, run 'git branch -D dev'.
-PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git branch -D dev
-Deleted branch dev (was c2a5f471375).
-PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> 
+<!--
+ * @Author: LetMeFly
+ * @Date: 2025-07-16 12:54:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-16 13:00:06
+-->
+commit 711e3d3e6cb6b33b03bd7933d2efaa99d2f798fe (HEAD -> dev)
+Author: LetMeFly666 <[email protected]>
+Date:   Mon Jul 14 19:00:34 2025 +0800
+
+    word: en
+
+commit eed54c5ded68eee85ab6d272f3637863931e2949
+Author: LetMeFly666 <[email protected]>
+Date:   Mon Jul 14 18:58:36 2025 +0800
+
+    fix: 昨晚消失的commit
+    
+    Signed-off-by: LetMeFly666 <[email protected]>
+
+
+
+git cherry-pick 711e3d3e6cb6b33b03bd7933d2efaa99d2f798fe
+自动合并 Solutions/Other-English-LearningNotes-SomeWords.md
+[dev 17b46a66d] word: en
+ Date: Mon Jul 14 19:00:34 2025 +0800
+ 1 file changed, 4 insertions(+), 1 deletion(-)
+
+➜  LeetCode git:(dev) git branch -d temp                                      
+错误：分支 'temp' 没有完全合并
+提示： 如果您确认要删除它，执行 'git branch -D temp'
+提示： Disable this message with "git config set advice.forceDeleteBranch false"
+➜  LeetCode git:(dev) git branch -D temp
+已删除分支 temp（曾为 711e3d3e6）。

.gitlog

@@ -0,0 +1,33 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-07-16 13:16:29
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-16 13:19:44
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int maximumLength(vector<int>& nums) {
+        int ans = 0;
+        int odd = 0;
+        bool last = nums[0] % 2 ? false : true;
+        for (int t : nums) {
+            if (t % 2) {
+                odd++;
+                if (!last) {
+                    last = true;
+                    ans++;
+                }
+            } else {
+                if (last) {
+                    last = false;
+                    ans++;
+                }
+            }
+        }
+        return max(ans, max(odd, int(nums.size()) - odd));
+    }
+};

Codes/3201-find-the-maximum-length-of-valid-subsequence-i.cpp

@@ -0,0 +1,27 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-07-16 13:16:29
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-16 13:40:18
+ */
+package main
+
+func maximumLength(nums []int) (ans int) {
+    odd := 0
+    last := nums[0] % 2 == 0
+    for _, t := range nums {
+        if t % 2 == 0 {
+            if last {
+                last = false
+                ans++
+            }
+        } else {
+            odd++
+            if !last {
+                last = true
+                ans++
+            }
+        }
+    }
+    return max(ans, max(odd, len(nums) - odd))
+}

Codes/3201-find-the-maximum-length-of-valid-subsequence-i.go

@@ -0,0 +1,28 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-07-16 13:16:29
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-07-16 13:41:23
+ */
+class Solution {
+    public int maximumLength(int[] nums) {
+        int ans = 0;
+        int odd = 0;
+        boolean last = nums[0] % 2 == 0;
+        for (int t : nums) {
+            if (t % 2 == 0) {
+                if (last) {
+                    last = false;
+                    ans++;
+                }
+            } else {
+                odd++;
+                if (!last) {
+                    last = true;
+                    ans++;
+                }
+            }
+        }
+        return Math.max(ans, Math.max(odd, nums.length - odd));
+    }
+}

Codes/3201-find-the-maximum-length-of-valid-subsequence-i.java

@@ -0,0 +1,23 @@
+'''
+Author: LetMeFly
+Date: 2025-07-16 13:16:29
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-07-16 13:36:53
+'''
+from typing import List
+
+class Solution:
+    def maximumLength(self, nums: List[int]) -> int:
+        ans = odd = 0
+        last = False if nums[0] % 2 else True
+        for t in nums:
+            if t % 2:
+                odd += 1
+                if not last:
+                    last = True
+                    ans += 1
+            else:
+                if last:
+                    last = False
+                    ans += 1
+        return max(ans, odd, len(nums) - odd)

Codes/3201-find-the-maximum-length-of-valid-subsequence-i.py

@@ -954,6 +954,7 @@
 |3192.使二进制数组全部等于1的最少操作次数II|中等|<a href="https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/19/LeetCode%203192.%E4%BD%BF%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E7%BB%84%E5%85%A8%E9%83%A8%E7%AD%89%E4%BA%8E1%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/143066863" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/solutions/2956341/letmefly-3192shi-er-jin-zhi-shu-zu-quan-ih15d/" target="_blank">LeetCode题解</a>|
 |3194.最小元素和最大元素的最小平均值|简单|<a href="https://leetcode.cn/problems/minimum-average-of-smallest-and-largest-elements/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/16/LeetCode%203194.%E6%9C%80%E5%B0%8F%E5%85%83%E7%B4%A0%E5%92%8C%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B9%B3%E5%9D%87%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/142994095" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-average-of-smallest-and-largest-elements/solutions/2953616/letmefly-3194zui-xiao-yuan-su-he-zui-da-6f4v5/" target="_blank">LeetCode题解</a>|
 |3200.三角形的最大高度|简单|<a href="https://leetcode.cn/problems/maximum-height-of-a-triangle/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/15/LeetCode%203200.%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E9%AB%98%E5%BA%A6/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/142967272" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-height-of-a-triangle/solutions/2952209/letmefly-3200san-jiao-xing-de-zui-da-gao-m23t/" target="_blank">LeetCode题解</a>|
+|3201.找出有效子序列的最大长度I|中等|<a href="https://leetcode.cn/problems/find-the-maximum-length-of-valid-subsequence-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/07/16/LeetCode%203201.%E6%89%BE%E5%87%BA%E6%9C%89%E6%95%88%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E9%95%BF%E5%BA%A6I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/149409629" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-maximum-length-of-valid-subsequence-i/solutions/3725834/letmefly-3201zhao-chu-you-xiao-zi-xu-lie-3quj/" target="_blank">LeetCode题解</a>|
 |3206.交替组I|简单|<a href="https://leetcode.cn/problems/alternating-groups-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/11/26/LeetCode%203206.%E4%BA%A4%E6%9B%BF%E7%BB%84I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144071026" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/alternating-groups-i/solutions/3001910/letmefly-3206jiao-ti-zu-ibian-li-by-tisf-euqx/" target="_blank">LeetCode题解</a>|
 |3208.交替组II|中等|<a href="https://leetcode.cn/problems/alternating-groups-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/11/28/LeetCode%203208.%E4%BA%A4%E6%9B%BF%E7%BB%84II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144123453" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/alternating-groups-ii/solutions/3004235/letmefly-3208jiao-ti-zu-iihua-dong-chuan-5bcc/" target="_blank">LeetCode题解</a>|
 |3211.生成不含相邻零的二进制字符串|中等|<a href="https://leetcode.cn/problems/generate-binary-strings-without-adjacent-zeros/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/29/LeetCode%203211.%E7%94%9F%E6%88%90%E4%B8%8D%E5%90%AB%E7%9B%B8%E9%82%BB%E9%9B%B6%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/143352841" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/generate-binary-strings-without-adjacent-zeros/solutions/2970587/letmefly-3211sheng-cheng-bu-han-xiang-li-sdh3/" target="_blank">LeetCode题解</a>|