扑克牌中的顺子

题目:从扑克牌中随机抽5张牌,判断是不是一个顺子,即这5张牌是不是连续的。2~10为数字本身,A为1,J为11,Q为12,K为13,而大、小王可以看成任意数字。

把0看成大小王

int compare(const void* arg1, const void* arg2)
{
	return *(int*)arg1 - *(int*)arg2;
}
bool isContinuous(int* numbers, int length)
{
	if (numbers == nullptr || length < 1)
		return false;

	int numberOfZero = 0;
	int numberOfGap = 0;

	qsort(numbers, length, sizeof(int), compare);

	for (int i = 0;i < length&&numbers[i] == 0;++i)
		++numberOfZero;

	int small = numberOfZero;
	int big = small + 1;

	while (big < length)
	{
		if (numbers[small] == numbers[big])
			return false;

		numberOfGap += numbers[big] - numbers[small] - 1;

		small = big;
		++big;
	}

	return (numberOfGap > numberOfZero) ? false : true;
}

猜你喜欢

转载自blog.csdn.net/weixin_39916039/article/details/82951944