两个键的键盘

/*
 * Problem Statement: Starting with a single character 'A', you can perform two operations: 'Copy All' (copies all the characters in the notepad) and 'Paste' (pastes the last copied characters). Given a number 'n', determine the minimum number of operations required to produce exactly 'n' characters.
 * 
 * Solution Approach: Similar to the Java approach, we use a stream to iterate over the possible factors and sum them up when the number 'n' can be divided by these factors. This approach also calculates the minimum steps by finding the prime factors of 'n'.
 */
import java.util.stream.IntStream;
 
public class Solution {
    public int minSteps(int n) {
        if (n == 1) return 0;
        return IntStream.rangeClosed(2, n)
            .filter(i -> n % i == 0)
            .flatMap(i -> {
                int[] arr = new int[n];
                int count = 0;
                while (n % i == 0) {
                    arr[count++] = i;
                    n /= i;
                }
                return IntStream.of(arr).limit(count);
            })
            .sum();
    }
}