使用Java的LinkedHashMap按出现的顺序打印字符及其频率

给定一个仅包含小写字符的字符串str 。任务是按照给定字符串出现的顺序打印字符及其频率。
例子：

Input: str = “geeksforgeeks” 
Output: g2 e4 k2 s2 f1 o1 r1
Input: str = “helloworld” 
Output: h1 e1 l3 o2 w1 r1 d1

方法：通过遍历字符的给定字符串的字符和所有的字符串的频率存储在其中保持在存储它们的元素的顺序LinkedHashMap中。现在，遍历LinkedhashMap的元素并打印内容。
下面是上述方法的实现：

Java

// Java implementation of the approach
import java.util.LinkedHashMap;
 
public class GFG {
 
    // Function to print the characters and their
    // frequencies in the order of their occurrence
    static void printCharWithFreq(String str, int n)
    {
 
        // LinkedHashMap preserves the order in
        // which the input is supplied
        LinkedHashMap lhm
            = new LinkedHashMap();
 
        // For every character of the input string
        for (int i = 0; i < n; i++) {
 
            // Using java 8 getorDefault method
            char c = str.charAt(i);
            lhm.put(c, lhm.getOrDefault(c, 0) + 1);
        }
 
        // Iterate using java 8 forEach method
        lhm.forEach(
            (k, v) -> System.out.print(k + " " + v));
    }
 
    // Driver code
    public static void main(String[] args)
    {
        String str = "geeksforgeeks";
        int n = str.length();
 
        printCharWithFreq(str, n);
    }
}

输出：

g2 e4 k2 s2 f1 o1 r1