最小偶倍数

// Solution for finding the LCM of 2 and n using Java Stream API
// Approach: The Java Stream API doesn't directly support operations like GCD or LCM. However, we can still utilize functional programming aspects and streams to encapsulate the process.

import java.util.stream.IntStream;

public class Solution {
    public int findLCM(int n) {
        // Using stream to find GCD
        int gcd = IntStream.iterate(new int[]{2, n}, arr -> new int[]{arr[1], arr[0] % arr[1]})
                           .filter(arr -> arr[1] == 0)
                           .map(arr -> arr[0])
                           .findFirst()
                           .getAsInt();
        // Calculating LCM using the formula (2 * n) / gcd
        return (2 * n) / gcd;
    }
}