当前位置：网站首页>Leetcode daily question 1189 The maximum number of "balloons" simple simulation questions~

Leetcode daily question 1189 The maximum number of "balloons" simple simulation questions~

2022-07-05 22:48:00 【Ape Xiaofu】

Content of this article ：leetcode A daily topic 1189. “ balloon ” Maximum number of Simple simulation questions ~

Article column ：leetcode A daily topic 《 Punch in daily 》

Recent updates ：2022 year 2 month 12 Japan leetcode A daily topic 1020. The number of enclaves ordinary DFS Board question Find out whether it is an enclave according to whether it is connected to the boundary ~

Personal profile ： A Junior Program ape in two colleges , In the spirit of paying attention to the foundation , Clock in algorithm , Sharing technology as a personal experience summary blogger , Although you may be lazy sometimes , But I will stick to it , If you like blog posts very much , Suggest looking at the following line ~（ Crazy hints QwQ）

give the thumbs-up Collection Leaving a message. One key, three links _{Care program ape , From you and me}

Write it at the front

Simple simulation questions qwq It won't take a word

subject

Give you a string text, You need to use text To piece together as many words as possible “balloon”（ balloon ）.

character string text Each letter in can only be used once at most . Please return the maximum number of words you can piece together “balloon”.

Example

Insert picture description here

Example 1：

 Input ：text = "nlaebolko"
 Output ：1

Insert picture description here

Example 2:

 Input ：text = "loonbalxballpoon"
 Output ：2

Tips

1 <= text.length <= 10^4
text All consist of lowercase English letters

Ideas

This question examines the knowledge points

Simple simulation questions , But Xiao Fu writes more , But the idea must be like this qwq
Notice how many groups there are balloon Each group of words l And o Will be consumed first Then unify

Code implementation

Sort + The sliding window

class Solution {
    
    public int maxNumberOfBalloons(String text) {
    
        Map<Character ,Integer> map = new HashMap<Character,Integer>(); 
        
        char[] ss = text.toCharArray();

        for (int i = 0 ; i< ss.length;i++){
    
            map.put(ss[i],map.getOrDefault(ss[i],0)+1);
        }

        int res = 0;
        int b = map.getOrDefault('b',0);
        int a = map.getOrDefault('a',0);
        int l = map.getOrDefault('l',0);
        int o = map.getOrDefault('o',0);
        int n = map.getOrDefault('n',0);

        int count1 = Math.min(Math.min(b,a),n);
        int count2 = Math.min(l/2,o/2);
        return Math.min(count1,count2);
    }
}