2021/09/14 글 목록

[LeetCode - Daily Challenge] 1189. Maximum Number of Balloons

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem 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 = "leetc..

Algorithm/LeetCode Daily Challenge 2021. 9. 14. 10:58

이전 1 다음

이전 다음

공지사항

최근에 올라온 글