Given a string, sort it in decreasing order based on the frequency of characters.
Input: "tree" Output: "eert" Explanation: 'e' appears twice while 'r' and 't' both appear once. So 'e' must appear before both 'r' and 't'. Therefore "eetr" is also a valid answer.
Input: "cccaaa" Output: "cccaaa" Explanation: Both 'c' and 'a' appear three times, so "aaaccc" is also a valid answer. Note that "cacaca" is incorrect, as the same characters must be together.
Input: "Aabb" Output: "bbAa" Explanation: "bbaA" is also a valid answer, but "Aabb" is incorrect. Note that 'A' and 'a' are treated as two different characters.
class Solution(object): def frequencySort(self, s): """ :type s: str :rtype: str """ import collections c = collections.Counter(s) tup =  for key in c: tup.append((key, c[key])) tup.sort(key = lambda x:x, reverse = True) res = "" for t in tup: res += t * t return res