根据字符的频率对字符串进行排序

给定一个字符串str ，任务是根据每个字符的频率，按升序对字符串进行排序。如果两个元素具有相同的频率，则它们按字典顺序排序。
例子：

Input: str = “geeksforgeeks” 
Output: forggkksseeee 
Explanation: 
Frequency of characters: g2 e4 k2 s2 f1 o1 r1 
Sorted characters according to frequency: f1 o1 r1 g2 k2 s2 e4 
f, o, r occurs one time so they are ordered lexicographically and so are g, k and s. 
Hence the final output is forggkksseeee.
Input: str = “abc” 
Output: abc 

方法这个想法是将每个字符及其频率存储在一个向量对中，然后根据存储的频率对向量对进行排序。最后，按顺序打印向量。
下面是上述方法的实现：

C++

// C++ implementation to Sort strings
// according to the frequency of
// characters in ascending order
 
#include 
using namespace std;
 
// Returns count of character in the string
int countFrequency(string str, char ch)
{
    int count = 0;
 
    for (int i = 0; i < str.length(); i++)
 
        // Check for vowel
        if (str[i] == ch)
            ++count;
 
    return count;
}
 
// Function to sort the string
// according to the frequency
void sortArr(string str)
{
    int n = str.length();
 
    // Vector to store the frequency of
    // characters with respective character
    vector > vp;
 
    // Inserting frequency
    // with respective character
    // in the vector pair
    for (int i = 0; i < n; i++) {
 
        vp.push_back(
            make_pair(
                countFrequency(str, str[i]),
                str[i]));
    }
 
    // Sort the vector, this will sort the pair
    // according to the number of characters
    sort(vp.begin(), vp.end());
 
    // Print the sorted vector content
    for (int i = 0; i < vp.size(); i++)
        cout << vp[i].second;
}
 
// Driver code
int main()
{
    string str = "geeksforgeeks";
 
    sortArr(str);
 
    return 0;
}

Python3

# Python3 implementation to Sort strings
# according to the frequency of
# characters in ascending order
 
# Returns count of character in the string
def countFrequency(string ,  ch) :
 
    count = 0;
 
    for i in range(len(string)) :
 
        # Check for vowel
        if (string[i] == ch) :
            count += 1;
 
    return count;
 
# Function to sort the string
# according to the frequency
def sortArr(string) :
    n = len(string);
 
    # Vector to store the frequency of
    # characters with respective character
    vp = [];
 
    # Inserting frequency
    # with respective character
    # in the vector pair
    for i in range(n) :
 
        vp.append((countFrequency(string, string[i]), string[i]));
         
    # Sort the vector, this will sort the pair
    # according to the number of characters
    vp.sort();
     
    # Print the sorted vector content
    for i in range(len(vp)) :
        print(vp[i][1],end="");
 
# Driver code
if __name__ == "__main__" :
 
    string = "geeksforgeeks";
 
    sortArr(string);
 
    # This code is contributed by Yash_R

Javascript

 
// JavaScript implementation of the above approach
 
// Returns count of character in the string
function countFrequency(str, ch)
{
    var count = 0;
 
    for (var i = 0; i < str.length; i++)
 
        // Check for vowel
        if (str[i] == ch)
            ++count;
 
    return count;
}
 
// Function to sort the string
// according to the frequency
function sortArr(str)
{
    var n = str.length;
 
    // Vector to store the frequency of
    // characters with respective character
    vp = new Array(n);
 
    // Inserting frequency
    // with respective character
    // in the vector pair
    for (var i = 0; i < n; i++) {
 
        vp[i] = [countFrequency(str, str[i]), str[i]];
    }
 
    // Sort the vector, this will sort the pair
    // according to the number of characters
    vp.sort();
 
    // Print the sorted vector content
    for (var i = 0; i < n; i++)
        document.write(vp[i][1]);
}
 
// Driver Code
 
// Array of points
let str = "geeksforgeeks";
sortArr(str);
 

输出：

forggkksseeee

时间复杂度： O(n ² )

辅助空间： O(n)

如果您想与行业专家一起参加直播课程，请参阅Geeks Classes Live