feat: add solutions to lc problem: No.2063.Vowels of All Substrings

Author: yanglbme

solution/2000-2099/2063.Vowels of All Substrings/README.md

@@ -66,7 +66,7 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-判断word[i]是否为元音，且在所有子字符串中一共出现了 (i+1)*(n-i) 次
+判断 `word[i]` 是否为元音，且在所有子字符串中一共出现了 `(i+1)*(n-i)` 次。
 
 <!-- tabs:start -->
 
@@ -75,15 +75,32 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def countVowels(self, word: str) -> int:
+        ans, n = 0, len(word)
+        for i, c in enumerate(word):
+            if c in ['a', 'e', 'i', 'o', 'u']:
+                ans += (i + 1) * (n - i)
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public long countVowels(String word) {
+        long ans = 0;
+        for (int i = 0, n = word.length(); i < n; ++i) {
+            char c = word.charAt(i);
+            if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') {
+                ans += (long) (i + 1) * (n - i);
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **TypeScript**
@@ -102,6 +119,38 @@ function countVowels(word: string): number {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    long long countVowels(string word) {
+        long long ans = 0;
+        for (int i = 0, n = word.size(); i < n; ++i)
+        {
+            char c = word[i];
+            if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') ans += (long long) (i + 1) * (n - i);
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func countVowels(word string) int64 {
+	var ans int64
+	n := len(word)
+	for i, c := range word {
+		if c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' {
+			ans += int64((i + 1) * (n - i))
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/2000-2099/2063.Vowels of All Substrings/README_EN.md

@@ -58,15 +58,37 @@ Hence, the total sum of vowels = 1 + 1 + 1 + 0 + 0 + 0 = 3. </pre>
 	<li><code>word</code> consists of lowercase English letters.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
+class Solution:
+    def countVowels(self, word: str) -> int:
+        ans, n = 0, len(word)
+        for i, c in enumerate(word):
+            if c in ['a', 'e', 'i', 'o', 'u']:
+                ans += (i + 1) * (n - i)
+        return ans
+```
+
+### **Java**
 
+```java
+class Solution {
+    public long countVowels(String word) {
+        long ans = 0;
+        for (int i = 0, n = word.length(); i < n; ++i) {
+            char c = word.charAt(i);
+            if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') {
+                ans += (long) (i + 1) * (n - i);
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **TypeScript**
@@ -85,10 +107,36 @@ function countVowels(word: string): number {
 };
 ```
 
-### **Java**
-
-```java
+### **C++**
+
+```cpp
+class Solution {
+public:
+    long long countVowels(string word) {
+        long long ans = 0;
+        for (int i = 0, n = word.size(); i < n; ++i)
+        {
+            char c = word[i];
+            if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') ans += (long long) (i + 1) * (n - i);
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func countVowels(word string) int64 {
+	var ans int64
+	n := len(word)
+	for i, c := range word {
+		if c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' {
+			ans += int64((i + 1) * (n - i))
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/2000-2099/2063.Vowels of All Substrings/Solution.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    long long countVowels(string word) {
+        long long ans = 0;
+        for (int i = 0, n = word.size(); i < n; ++i)
+        {
+            char c = word[i];
+            if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') ans += (long long) (i + 1) * (n - i);
+        }
+        return ans;
+    }
+};

solution/2000-2099/2063.Vowels of All Substrings/Solution.go

@@ -0,0 +1,10 @@
+func countVowels(word string) int64 {
+	var ans int64
+	n := len(word)
+	for i, c := range word {
+		if c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' {
+			ans += int64((i + 1) * (n - i))
+		}
+	}
+	return ans
+}

solution/2000-2099/2063.Vowels of All Substrings/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public long countVowels(String word) {
+        long ans = 0;
+        for (int i = 0, n = word.length(); i < n; ++i) {
+            char c = word.charAt(i);
+            if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') {
+                ans += (long) (i + 1) * (n - i);
+            }
+        }
+        return ans;
+    }
+}

solution/2000-2099/2063.Vowels of All Substrings/Solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def countVowels(self, word: str) -> int:
+        ans, n = 0, len(word)
+        for i, c in enumerate(word):
+            if c in ['a', 'e', 'i', 'o', 'u']:
+                ans += (i + 1) * (n - i)
+        return ans