LeetCode1371. Find the Longest Substring Containing Vowels in Even Counts
文章目录一、题目二、题解一、题目Giventhestrings,returnthesizeofthelongestsubstringcontainingeachvowelanevennumberoftimes.Thatis,‘a’,‘e’,‘i’,‘o’,and‘u’mustappearanevennumberoftimes.Example1:Input:s=“eleetminicoworoep”