记录一下斐蜀定理
求解多个数的最大公约数可用
class Solution {
public boolean isGoodArray(int[] nums) {
int size = nums.length;
int gcd = nums[0];
for (int i = 1; i < size; i++) {
gcd = gcd(nums[i], gcd);
}
return gcd == 1;
}
private int gcd(int num1, int num2) {
while (num2 != 0) {
int t = num2;
num2 = num1 % num2;
num1 = t;
}
return num1;
}
}