制造字母异位词的最小步骤数 II

// Java Stream solution to find the minimum steps to make two strings anagrams
// by appending characters to either string

import java.util.stream.*;

public class AnagramStepsStream {
    public int minSteps(String s, String t) {
        // Create frequency arrays for both strings
        int[] sFreq = new int[26];
        int[] tFreq = new int[26];
        
        // Populate frequency arrays using Streams
        s.chars().forEach(c -> sFreq[c - 'a']++);
        t.chars().forEach(c -> tFreq[c - 'a']++);
        
        // Calculate the total number of steps needed using Streams
        return IntStream.range(0, 26)
                         .map(i -> Math.abs(sFreq[i] - tFreq[i]))
                         .sum();
    }
    
    public static void main(String[] args) {
        AnagramStepsStream solution = new AnagramStepsStream();
        String s = "leetcode";
        String t = "coats";
        System.out.println(solution.minSteps(s, t)); // Output: 7
    }
}