classSolution:deflongestDiverseString(self, a:int, b:int, c:int)->str:# main idea: use a greedy approach. Every time, try to take one char from the category with the maximum count. And use heap to maintain the order
题目解法贪心思想。每次取个数最多的来加,同时判断前两个是否相同。利用最大堆保持顺序。class Solution: def longestDiverseString(self, a: int, b: int, c: int) -> str: # main idea: use a greedy approach. Every time, try to take one char from the category with the maximum count. And u