longest-substring-of-all-vowels-in-order

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

A string is considered beautiful if it satisfies the following conditions:

<ul>
	<li>Each of the 5 English vowels (<code>&#39;a&#39;</code>, <code>&#39;e&#39;</code>, <code>&#39;i&#39;</code>, <code>&#39;o&#39;</code>, <code>&#39;u&#39;</code>) must appear at least once in it.</li>
	<li>The letters must be sorted in alphabetical order (i.e. all <code>&#39;a&#39;</code>s before <code>&#39;e&#39;</code>s, all <code>&#39;e&#39;</code>s before <code>&#39;i&#39;</code>s, etc.).</li>
</ul>

For example, strings <code>&quot;aeiou&quot;</code> and <code>&quot;aaaaaaeiiiioou&quot;</code> are considered beautiful, but <code>&quot;uaeio&quot;</code>, <code>&quot;aeoiu&quot;</code>, and <code>&quot;aaaeeeooo&quot;</code> are not beautiful.

Given a string <code>word</code> consisting of English vowels, return the length of the longest beautiful substring of <code>word</code>. If no such substring exists, return <code>0</code>.

A substring is a contiguous sequence of characters in a string.

&nbsp;
Example 1:

<pre>
Input: word = &quot;aeiaaioaaaaeiiiiouuuooaauuaeiu&quot;
Output: 13
Explanation: The longest beautiful substring in word is &quot;aaaaeiiiiouuu&quot; of length 13.</pre>

Example 2:

<pre>
Input: word = &quot;aeeeiiiioooauuuaeiou&quot;
Output: 5
Explanation: The longest beautiful substring in word is &quot;aeiou&quot; of length 5.
</pre>

Example 3:

<pre>
Input: word = &quot;a&quot;
Output: 0
Explanation: There is no beautiful substring, so return 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= word.length &lt;= 5 * 105</code></li>
	<li><code>word</code> consists of characters <code>&#39;a&#39;</code>, <code>&#39;e&#39;</code>, <code>&#39;i&#39;</code>, <code>&#39;o&#39;</code>, and <code>&#39;u&#39;</code>.</li>
</ul>

longestBeautifulSubstring

Longest Substring Of All Vowels in Order

Count Vowel Substrings of a String

count-vowel-substrings-of-a-string

统计字符串中的元音子字符串

Longest Nice Subarray

longest-nice-subarray

最长优雅子数组

Count of Substrings Containing Every Vowel and K Consonants II

count-of-substrings-containing-every-vowel-and-k-consonants-ii

元音辅音字符串计数 II

Count of Substrings Containing Every Vowel and K Consonants I

count-of-substrings-containing-every-vowel-and-k-consonants-i

元音辅音字符串计数 I

String

Sliding Window

当一个字符串满足如下条件时，我们称它是 美丽的 ：

<ul>
	<li>所有 5 个英文元音字母（<code>'a'</code> ，<code>'e'</code> ，<code>'i'</code> ，<code>'o'</code> ，<code>'u'</code>）都必须 至少 出现一次。</li>
	<li>这些元音字母的顺序都必须按照 字典序 升序排布（也就是说所有的 <code>'a'</code> 都在 <code>'e'</code> 前面，所有的 <code>'e'</code> 都在 <code>'i'</code> 前面，以此类推）</li>
</ul>

比方说，字符串 <code>"aeiou"</code> 和 <code>"aaaaaaeiiiioou"</code> 都是 美丽的 ，但是 <code>"uaeio"</code> ，<code>"aeoiu"</code> 和 <code>"aaaeeeooo"</code> 不是美丽的 。

给你一个只包含英文元音字母的字符串 <code>word</code> ，请你返回 <code>word</code> 中 最长美丽子字符串的长度 。如果不存在这样的子字符串，请返回 <code>0</code> 。

子字符串 是字符串中一个连续的字符序列。

 

示例 1：

<pre>
输入：word = "aeiaaioaaaaeiiiiouuuooaauuaeiu"
输出：13
解释：最长子字符串是 "aaaaeiiiiouuu" ，长度为 13 。</pre>

示例 2：

<pre>
输入：word = "aeeeiiiioooauuuaeiou"
输出：5
解释：最长子字符串是 "aeiou" ，长度为 5 。
</pre>

示例 3：

<pre>
输入：word = "a"
输出：0
解释：没有美丽子字符串，所以返回 0 。
</pre>

 

提示：

<ul>
	<li><code>1 <= word.length <= 5 * 105</code></li>
	<li><code>word</code> 只包含字符 <code>'a'</code>，<code>'e'</code>，<code>'i'</code>，<code>'o'</code> 和 <code>'u'</code> 。</li>
</ul>