LeetCode --- 1189. Maximum Number of Balloons 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1189. Maximum Number of Balloons 解题报告相关的知识,希望对你有一定的参考价值。
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
以上是关于LeetCode --- 1189. Maximum Number of Balloons 解题报告的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode --- 1189. Maximum Number of Balloons 解题报告
LeetCode笔记:Biweekly Contest 94