Py3 C++奇偶交錯奇偶子數列解Leecode 3201 Find the Maximum Length of Valid Subsequ...

Py3  C++奇偶交錯奇偶子數列解Leecode 3201  Find the Maximum Length of Valid Subsequence I

求最長有效子序列，使得 (sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + sub[x - 1]) % 2，有 3 種可能的情況

-全為偶數

-全為奇數

-或奇偶交錯子序列

[Py3解請進]

Py3 C++母音 vowel mask速解Leetcode 3136 Valid Word

Py3 C++母音 vowel mask速解Leetcode 3136  Valid Word

Leetcode有許多判斷母音的問題，採用bitmask方式，迅速又方便

-----

Leetcode has many problems in determining vowels. Using the bitmask method is fast and convenient.

[codes onLeetcode]https://leetcode.com/problems/valid-word/solutions/6959558/bitmask-for-vowel-bitset-beats-100/