class Solution {
public:
int gcd(int a, int b) //辗转相除法
{
int temp = 0;
while(b)
{
temp = a%b;
a = b;
b = temp;
}
return a; //最后的返回值在a里
}
int findGCD(vector<int>& nums) {
int n = nums.size();
sort(nums.begin() , nums.end()); // sort 排序
int min = nums[0];
int max = nums[n-1];
int ans = gcd(min , max);
return ans;
}
};