leetcode1189.Maximum Number of Balloons
2022-03-01 13:09 作者:您是打尖兒還是住店呢 | 我要投稿
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 = "nlaebolko"Output: 1
Example 2:
Input: text = "loonbalxballpoon"Output: 2
Example 3:
Input: text = "leetcode"Output: 0
?
Constraints:
1 <= text.length <= 104
text
?consists of lower case English letters only.
Runtime:?3 ms, faster than?68.08%?of?Java?online submissions for?Maximum Number of Balloons.
Memory Usage:?42.4 MB, less than?36.89%?of?Java?online submissions for?Maximum Number of Balloons.
標(biāo)簽: