vowels-of-all-substrings

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>word</code>, return the sum of the number of vowels (<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>) in every substring of <code>word</code>.

A substring is a contiguous (non-empty) sequence of characters within a string.

Note: Due to the large constraints, the answer may not fit in a signed 32-bit integer. Please be careful during the calculations.

&nbsp;
Example 1:

<pre>
Input: word = &quot;aba&quot;
Output: 6
Explanation: 
All possible substrings are: &quot;a&quot;, &quot;ab&quot;, &quot;aba&quot;, &quot;b&quot;, &quot;ba&quot;, and &quot;a&quot;.
- &quot;b&quot; has 0 vowels in it
- &quot;a&quot;, &quot;ab&quot;, &quot;ba&quot;, and &quot;a&quot; have 1 vowel each
- &quot;aba&quot; has 2 vowels in it
Hence, the total sum of vowels = 0 + 1 + 1 + 1 + 1 + 2 = 6. 
</pre>

Example 2:

<pre>
Input: word = &quot;abc&quot;
Output: 3
Explanation: 
All possible substrings are: &quot;a&quot;, &quot;ab&quot;, &quot;abc&quot;, &quot;b&quot;, &quot;bc&quot;, and &quot;c&quot;.
- &quot;a&quot;, &quot;ab&quot;, and &quot;abc&quot; have 1 vowel each
- &quot;b&quot;, &quot;bc&quot;, and &quot;c&quot; have 0 vowels each
Hence, the total sum of vowels = 1 + 1 + 1 + 0 + 0 + 0 = 3.
</pre>

Example 3:

<pre>
Input: word = &quot;ltcd&quot;
Output: 0
Explanation: There are no vowels in any substring of &quot;ltcd&quot;.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= word.length &lt;= 105</code></li>
	<li><code>word</code> consists of lowercase English letters.</li>
</ul>

第 266 场周赛

weekly-contest-266

countVowels

Vowels of All Substrings

Number of Substrings Containing All Three Characters

number-of-substrings-containing-all-three-characters

包含所有三种字符的子字符串数目

Total Appeal of A String

total-appeal-of-a-string

字符串的总引力

Math

String

Dynamic Programming

Combinatorics

给你一个字符串 <code>word</code> ，返回 <code>word</code> 的所有子字符串中 元音的总数 ，元音是指 <code>'a'</code>、<code>'e'</code>、<code>'i'</code>、<code>'o'</code> 和 <code>'u'</code> 。

子字符串 是字符串中一个连续（非空）的字符序列。

注意：由于对 <code>word</code> 长度的限制比较宽松，答案可能超过有符号 32 位整数的范围。计算时需当心。

&nbsp;

示例 1：

<pre>
输入：word = "aba"
输出：6
解释：
所有子字符串是："a"、"ab"、"aba"、"b"、"ba" 和 "a" 。
- "b" 中有 0 个元音
- "a"、"ab"、"ba" 和 "a" 每个都有 1 个元音
- "aba" 中有 2 个元音
因此，元音总数 = 0 + 1 + 1 + 1 + 1 + 2 = 6 。
</pre>

示例 2：

<pre>
输入：word = "abc"
输出：3
解释：
所有子字符串是："a"、"ab"、"abc"、"b"、"bc" 和 "c" 。
- "a"、"ab" 和 "abc" 每个都有 1 个元音
- "b"、"bc" 和 "c" 每个都有 0 个元音
因此，元音总数 = 1 + 1 + 1 + 0 + 0 + 0 = 3 。</pre>

示例 3：

<pre>
输入：word = "ltcd"
输出：0
解释："ltcd" 的子字符串均不含元音。</pre>

示例 4：

<pre>
输入：word = "noosabasboosa"
输出：237
解释：所有子字符串中共有 237 个元音。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= word.length &lt;= 105</code></li>
	<li><code>word</code> 由小写英文字母组成</li>
</ul>