[1979] Find Greatest Common Divisor of Array

要寫別題的前傳(?)

int findGCD(int* nums, int numsSize) {

int min =1000;

int max = 0;

for (int i=0; i< numsSize; i++)

{

if (nums[i]> max)

max = nums[i];

if (nums[i]< min)

min = nums[i];

}

while (max%min !=0)

{

int tmp = max%min;

max= min;

min = tmp;

}

return min;

}