int findGCD(int* nums, int numsSize) {
int max, min;
max = min = nums[0];
for (int i = 1; i < numsSize; i++)
{
if (max < nums[i])max = nums[i];
if (min > nums[i])min = nums[i];
}
while (max && min)
{
if (max > min)max %= min;
else min %= max;
}
return (max > min) ? max : min;
}
04-18
10-25
98