update: 添加问题“3305.元音辅音字符串计数I”的代码和题解(#803)

feat: (#797)

close #795
如果这个commit成功close掉(#795)了，就说明(#795)完成了。
因为close(#795)的信息是来自.commitmsg文件的。

fix: python`os.system(f'git commit -s -m "{commitMsg}"')`无法处理多行
Signed-off-by: LetMeFly666 <[email protected]>

Author: LetMeFly666

.commitmsg

@@ -4,5 +4,4 @@ close #795
 如果这个commit成功close掉(#795)了，就说明(#795)完成了。
 因为close(#795)的信息是来自.commitmsg文件的。
 
-fix: 忘记转义了
-https://github.com/LetMeFly666/LeetCode/pull/799#discussion_r1986604369
+fix: python`os.system(f'git commit -s -m "{commitMsg}"')`无法处理多行

COMMITmultiline.py

@@ -0,0 +1,26 @@
+'''
+Author: LetMeFly
+Date: 2025-03-11 14:35:27
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-03-11 14:35:27
+'''
+'''
+Author: LetMeFly
+Date: 2025-03-11 14:23:47
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-03-11 14:33:39
+'''
+import os
+import subprocess
+commitMsg = "2s2d323\nsf\nf3"
+os.system('git add .')
+subprocess.run(['git', 'commit', '-s', '-m', commitMsg])
+
+"""
+import os
+commitMsg = "f\n2\n3"
+os.system('git add .')
+os.system(f'git commit -s -m "{commitMsg}"')
+
+执行这段代码执行结果的commit msg只会是f而无法添加下面的行
+"""

Codes/3305-count-of-substrings-containing-every-vowel-and-k-consonants-i.cpp

@@ -0,0 +1,46 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-12 09:29:51
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-12 09:40:21
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    static constexpr char yuanyin[] = "aeiou";
+    
+    inline bool allYuan(int* cnt) {
+        for (int i = 0; i < 5; i++) {
+            if (!cnt[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+public:
+    int countOfSubstrings(string word, int k) {
+        int ans = 0;
+        for (int i = 0; i < word.size(); i++) {
+            for (int j = i; j < word.size(); j++) {
+                int cnt[5] = {0};
+                int cntk = 0;
+                for (int m = i; m <= j; m++) {
+                    bool isYuan = false;
+                    for (int n = 0; n < 5; n++) {
+                        if (word[m] == yuanyin[n]) {
+                            isYuan = true;
+                            cnt[n]++;
+                            break;
+                        }
+                    }
+                    cntk += !isYuan;
+                }
+                ans += allYuan(cnt) && cntk == k;
+            }
+        }
+        return ans;
+    }
+};

Codes/3305-count-of-substrings-containing-every-vowel-and-k-consonants-i_n2.cpp

@@ -0,0 +1,44 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-12 09:38:45
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-12 09:40:10
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    static constexpr char yuanyin[] = "aeiou";
+    
+    inline bool allYuan(int* cnt) {
+        for (int i = 0; i < 5; i++) {
+            if (!cnt[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+public:
+    int countOfSubstrings(string word, int k) {
+        int ans = 0;
+        for (int i = 0; i < word.size(); i++) {
+            int cnt[5] = {0};
+            int cntk = 0;
+            for (int j = i; j < word.size(); j++) {
+                bool isYuan = false;
+                for (int n = 0; n < 5; n++) {
+                    if (word[j] == yuanyin[n]) {
+                        isYuan = true;
+                        cnt[n]++;
+                        break;
+                    }
+                }
+                cntk += !isYuan;
+                ans += allYuan(cnt) && cntk == k;
+            }
+        }
+        return ans;
+    }
+};

Codes/3305-count-of-substrings-containing-every-vowel-and-k-consonants-i_n2.go

@@ -0,0 +1,27 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-12 09:54:24
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-12 10:03:41
+ */
+package main
+
+var aeiou map[byte]bool = map[byte]bool{'a': true, 'e': true, 'i': true, 'o': true, 'u': true}
+
+func countOfSubstrings(word string, k int) (ans int) {
+    for i, _ := range word {
+        cnt5 := map[byte]bool{}
+        cntk := 0
+        for _, c := range word[i:] {
+            if aeiou[byte(c)] {
+                cnt5[byte(c)] = true
+            } else {
+                cntk++
+            }
+            if len(cnt5) == 5 && cntk == k {
+                ans++
+            }
+        }
+    }
+    return
+}

Codes/3305-count-of-substrings-containing-every-vowel-and-k-consonants-i_n2.java

@@ -0,0 +1,47 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-12 09:44:49
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-12 09:53:33
+ */
+class Solution {
+    private final char[] aeiou = {'a', 'e', 'i', 'o', 'u'};
+
+    private int isaeiou(char c) {
+        for (int i = 0; i < 5; i++) {
+            if (aeiou[i] == c) {
+                return i;
+            }
+        }
+        return -1;
+    }
+
+    private boolean all(int[] cnt) {
+        for (int i = 0; i < 5; i++) {
+            if (cnt[i] == 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    public int countOfSubstrings(String word, int k) {
+        int ans = 0;
+        for (int i = 0; i < word.length(); i++) {
+            int[] cnt5 = new int[5];
+            int cntk = 0;
+            for (int j = i; j < word.length(); j++) {
+                int index = isaeiou(word.charAt(j));
+                if (index == -1) {
+                    cntk++;
+                } else {
+                    cnt5[index]++;
+                }
+                if (all(cnt5) && cntk == k) {
+                    ans++;
+                }
+            }
+        }
+        return ans;
+    }
+}

Codes/3305-count-of-substrings-containing-every-vowel-and-k-consonants-i_n2.py

@@ -0,0 +1,21 @@
+'''
+Author: LetMeFly
+Date: 2025-03-12 09:41:17
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-03-12 09:44:21
+'''
+AEIOU = 'aeiou'
+class Solution:
+    def countOfSubstrings(self, word: str, k: int) -> int:
+        ans = 0
+        for i in range(len(word)):
+            cnt5 = [0] * 5
+            cntk = 0
+            for j in range(i, len(word)):
+                for n in range(5):
+                    if word[j] == AEIOU[n]:
+                        cnt5[n] += 1
+                        break
+                cntk += word[j] not in AEIOU
+                ans += all(cnt5) and cntk == k
+        return ans

README.md

@@ -919,6 +919,7 @@
 |3280.将日期转换为二进制表示|简单|<a href="https://leetcode.cn/problems/convert-date-to-binary/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/01/LeetCode%203280.%E5%B0%86%E6%97%A5%E6%9C%9F%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144870892" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/convert-date-to-binary/solutions/3036032/letmefly-3280jiang-ri-qi-zhuan-huan-wei-149mv/" target="_blank">LeetCode题解</a>|
 |3285.找到稳定山的下标|简单|<a href="https://leetcode.cn/problems/find-indices-of-stable-mountains/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/19/LeetCode%203285.%E6%89%BE%E5%88%B0%E7%A8%B3%E5%AE%9A%E5%B1%B1%E7%9A%84%E4%B8%8B%E6%A0%87/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144596618" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-indices-of-stable-mountains/solutions/3025068/letmefly-3285zhao-dao-wen-ding-shan-de-x-u3wc/" target="_blank">LeetCode题解</a>|
 |3297.统计重新排列后包含另一个字符串的子字符串数目I|中等|<a href="https://leetcode.cn/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/09/LeetCode%203297.%E7%BB%9F%E8%AE%A1%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E5%90%8E%E5%8C%85%E5%90%AB%E5%8F%A6%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%9B%AEI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145031494" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/solutions/3042787/letmefly-3297tong-ji-zhong-xin-pai-lie-h-8ele/" target="_blank">LeetCode题解</a>|
+|3305.元音辅音字符串计数I|中等|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/12/LeetCode%203305.%E5%85%83%E9%9F%B3%E8%BE%85%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%AE%A1%E6%95%B0I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146197747" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/solutions/3607571/letmefly-3305yuan-yin-fu-yin-zi-fu-chuan-ptkg/" target="_blank">LeetCode题解</a>|
 |剑指Offer0047.礼物的最大价值|简单|<a href="https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/03/08/LeetCode%20%E5%89%91%E6%8C%87%20Offer%2047.%20%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/129408765" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/solutions/2155672/letmefly-jian-zhi-offer-47li-wu-de-zui-d-rekb/" target="_blank">LeetCode题解</a>|
 |剑指OfferII0041.滑动窗口的平均值|简单|<a href="https://leetcode.cn/problems/qIsx9U/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/07/16/LeetCode%20%E5%89%91%E6%8C%87%20Offer%20II%200041.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E5%B9%B3%E5%9D%87%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/125819216" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/qIsx9U/solution/by-tisfy-30mq/" target="_blank">LeetCode题解</a>|
 |剑指OfferII0091.粉刷房子|中等|<a href="https://leetcode.cn/problems/JEj789/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/06/25/LeetCode%20%E5%89%91%E6%8C%87%20Offer%20II%200091.%20%E7%B2%89%E5%88%B7%E6%88%BF%E5%AD%90/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/125456885" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/JEj789/solution/letmefly-jian-zhi-offer-ii-091fen-shua-f-3olz/" target="_blank">LeetCode题解</a>|