检查「好数组」

/*
 * In this solution, we use Java Streams to simplify the code and make it more functional.
 * The logic remains the same as in the imperative approach: we calculate the GCD of all numbers
 * in the array and check if it is equal to 1. If so, we return true; otherwise, false.
 */

import java.util.stream.*;

public class GoodArrayCheckerStream {
    public boolean isGoodArray(int[] nums) {
        int gcd = Arrays.stream(nums)
                        .reduce(0, (a, b) -> gcd(a, b));
        return gcd == 1;
    }

    private int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}