2020年3月11日
371. Find the Longest Substring Containing Vowels in Even Counts
摘要： Given the string s, return the size of the longest substring containing each vowel an even number of times. That is, 'a', 'e', 'i', 'o', and 'u' must 阅读全文
posted @ 2020-03-11 08:36 Schwifty 阅读(271) 评论(0) 推荐(0)
1370. Increasing Decreasing String
摘要： Given a string s. You should re-order the string using the following algorithm: Pick the smallest character from s and append it to the result. Pick t 阅读全文
posted @ 2020-03-11 07:57 Schwifty 阅读(352) 评论(0) 推荐(0)