1189. “气球” 的最大数量

查看原题

解题思路

遍历字符串求出'balloon'单词所有需要的字母的个数，其中'l'和'o'要除以二并向下取整；再求出他们的最小值即可。

代码

 
/**
 * @param {string} text
 * @return {number}
 */
var maxNumberOfBalloons = function(text) {
	// 字符串中各个单词的数量
	let count_a = 0;
	let count_b = 0;
	let count_o = 0;
	let count_n = 0;
	let count_l = 0;
	let length = text.length;
	for(let i = 0; i <length; i++){
		switch (text[i]) {
			case 'a':
				count_a++;
				break;
			case 'b':
				count_b++;
				break;			
			case 'o':
				count_o++;
				break;			
			case 'n':
				count_n++;
				break;			
			case 'l':
				count_l++;
				break;
		}
	}
	const maxCount = Math.min(count_a,count_b,Math.floor(count_o / 2),Math.floor(count_l / 2),count_n);
	return maxCount;
};