给你一个字符串 s，它由小写英文字母和特殊字符：*、# 和 % 组成。 请根据以下规则从左到右处理 s 中的字符，构造一个新的字符串 result：

You are given a string s consisting of lowercase English letters and the special characters: *, #, and %. Build a new string result by processing s according to the following rules from left to right:

给你一个字符串 s，由小写英文字母和特殊字符：'*'、'#' 和 '%' 组成。 同时给你一个整数 k。

You are given a string s consisting of lowercase English letters and the special characters: '*', '#', and '%'. You are also given an integer k. Build a new string result by processing s according to the following rules from left to right:

给你一个字符串 text，你需要使用 text 中的字母来拼凑尽可能多的单词 "balloon"（气球）。 字符串 text 中的每个字母最多只能被使用一次。请你返回最多可以拼凑出多少个单词 "balloon"。   示例 1： 输入：text = "nlaebolko" 输出：1 示例 2： 输入：text = "loonbalxballpoon" 输出：2 示例 3： 输入：text = "leetcode" 输出：0   提示：

Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible. You can use each character in text at most once. Return the maximum number of instances that can be formed.   Example 1: Input: text =…

给你一个字符串数组 patterns 和一个字符串 word ，统计 patterns 中有多少个字符串是 word 的子字符串。返回字符串数目。 子字符串 是字符串中的一个连续字符序列。   示例 1： 输入：patterns = ["a","abc","bc","d"], word = "abc" 输出：3 解释： - "a" 是 "abc" 的子字符串。 - "abc" 是 "abc" 的子字符串。 - "bc" 是 "abc" 的子字符串。 - "d" 不是 "abc" 的子字符串。 patterns…

Given an array of strings patterns and a string word, return the number of strings in patterns that exist as a substring in word. A substring is a contiguous sequence of characters within a string.   Example 1: Input: patterns = ["a","abc","bc","d"], word…

给你一个字符串 s ，它只包含三种字符 a, b 和 c 。 请你返回 a，b 和 c 都 至少 出现过一次的子字符串数目。   示例 1： 输入：s = "abcabc" 输出：10 解释：包含 a，b 和 c 各至少一次的子字符串为 "abc", "abca", "abcab", "abcabc", "bca", "bcab", "bcabc", "cab", "cabc" 和 "abc" (相同字符串算多次)。 示例 2： 输入：s = "aaacb" 输出：3 解释：包含 a，b 和 c 各至少一次的子字符串为…

Given a string s consisting only of characters a, b and c. Return the number of substrings containing at least one occurrence of all these characters a, b and c.   Example 1: Input: s = "abcabc" Output: 10 Explanation: The substrings containing at least one…