leetcode LCP 06. 拿硬币

class Solution {
public:
int minCount(vector<int>& coins)
{
	int res = 0;
	for (int i = 0; i < coins.size(); i++)
	{
		res = res + coins[i] / 2;
		coins[i] = coins[i] % 2;
		if (coins[i] == 1)
		{
			res++;
		}
		else
			continue;
	}
	return res;
}
};