2025年7月16日
[LeetCode] 3201. Find the Maximum Length of Valid Subsequence I
摘要： You are given an integer array nums. A subsequence sub of nums with length x is called valid if it satisfies: (sub[0] + sub[1]) % 2 == (sub[1] + sub[2 阅读全文
posted @ 2025-07-16 04:55 CNoodle 阅读(72) 评论(0) 推荐(0)