求多个数的最小公倍数——C++实现

穷举法：

#include <iostream>
#include <vector>

using namespace std;

int commonMultipleOfTwoNumber(int a, int b)
{
	int result = a;
	if (a == 0 || b == 0)
		throw new exception("error");
	while (result % b != 0 || result % a != 0)
	{
		++result;
	}
	return result;
}

int leastCommonMultiple(vector<int> vec)
{
	int len = vec.size();
	if (len < 3)
		throw new exception("error");
	int result = vec[0];
	for (int i = 1; i < len; ++i)
	{
		result = commonMultipleOfTwoNumber(result, vec[i]);
		
	}
	return result;
}

int main()
{
	vector<int> vec = { 2, 3, 4 , 5, 7};
	cout << leastCommonMultiple(vec) << endl;
	return 0;
}