分享一个大牛的人工智能教程。零基础！通俗易懂！风趣幽默！希望你也加入到人工智能的队伍中来！请轻击人工智能教程https://www.captainai.net/troubleshooter
// 面试题61：扑克牌的顺子 // 题目：从扑克牌中随机抽5张牌，判断是不是一个顺子，即这5张牌是不是连续的。 // 2～10为数字本身，A为1，J为11，Q为12，K为13，而大、小王可以看成任意数字。 #include <cstdio> #include <cstdlib> int Compare(const void *arg1, const void *arg2); bool IsContinuous(int *numbers, int length) { if (numbers == nullptr || length < 1) return false; qsort(numbers, length, sizeof(int), Compare); int numberOfZero = 0; int numberOfGap = 0; // 统计数组中0的个数 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; } int Compare(const void *arg1, const void *arg2) { return *(int *)arg1 - *(int *)arg2; } // ====================测试代码==================== void Test(const char *testName, int *numbers, int length, bool expected) { if (testName != nullptr) printf("%s begins: ", testName); if (IsContinuous(numbers, length) == expected) printf("Passed.\n"); else printf("Failed.\n"); } void Test1() { int numbers[] = {1, 3, 2, 5, 4}; Test("Test1", numbers, sizeof(numbers) / sizeof(int), true); } void Test2() { int numbers[] = {1, 3, 2, 6, 4}; Test("Test2", numbers, sizeof(numbers) / sizeof(int), false); } void Test3() { int numbers[] = {0, 3, 2, 6, 4}; Test("Test3", numbers, sizeof(numbers) / sizeof(int), true); } void Test4() { int numbers[] = {0, 3, 1, 6, 4}; Test("Test4", numbers, sizeof(numbers) / sizeof(int), false); } void Test5() { int numbers[] = {1, 3, 0, 5, 0}; Test("Test5", numbers, sizeof(numbers) / sizeof(int), true); } void Test6() { int numbers[] = {1, 3, 0, 7, 0}; Test("Test6", numbers, sizeof(numbers) / sizeof(int), false); } void Test7() { int numbers[] = {1, 0, 0, 5, 0}; Test("Test7", numbers, sizeof(numbers) / sizeof(int), true); } void Test8() { int numbers[] = {1, 0, 0, 7, 0}; Test("Test8", numbers, sizeof(numbers) / sizeof(int), false); } void Test9() { int numbers[] = {3, 0, 0, 0, 0}; Test("Test9", numbers, sizeof(numbers) / sizeof(int), true); } void Test10() { int numbers[] = {0, 0, 0, 0, 0}; Test("Test10", numbers, sizeof(numbers) / sizeof(int), true); } // 有对子 void Test11() { int numbers[] = {1, 0, 0, 1, 0}; Test("Test11", numbers, sizeof(numbers) / sizeof(int), false); } // 鲁棒性测试 void Test12() { Test("Test12", nullptr, 0, false); } int main(int argc, char *argv[]) { Test1(); Test2(); Test3(); Test4(); Test5(); Test6(); Test7(); Test8(); Test9(); Test10(); Test11(); Test12(); return 0; } // ------ Output ------ /* Test1 begins: Passed. Test2 begins: Passed. Test3 begins: Passed. Test4 begins: Passed. Test5 begins: Passed. Test6 begins: Passed. Test7 begins: Passed. Test8 begins: Passed. Test9 begins: Passed. Test10 begins: Passed. Test11 begins: Passed. Test12 begins: Passed. */
