扑克牌顺子问题

来源：互联网发布：绝地求生n卡终极优化编辑：程序博客网时间：2024/05/16 10:57

<p style="margin-top: 0px; margin-bottom: 0px; padding-top: 0px; padding-bottom: 0px; font-family: Arial; font-size: 14px; line-height: 26px;"><span style="font-size: 16px;"><strong> 问题描述：从扑克牌中随机抽5张牌，判断是不是一个顺子，即这5张牌是不是连续的。2-10为数字本身，A为1，J为11，Q为12，K为13，而大小王可以看成任意数字。</strong><span style="font-family: Arial, Helvetica, simsun, u5b8bu4f53; line-height: 22px;"><span style="font-family: 宋体;"></span></span></span></p><p style="margin-top: 0px; margin-bottom: 0px; padding-top: 0px; padding-bottom: 0px; font-family: Arial; font-size: 14px; line-height: 26px;"><span style="font-size: 16px;">         思路：可以将这5张牌排个序，然后统计出0的个数以及非0数字之间的间隔数，如果出现重复的非0数字，那么不是顺子。如果间隔数小于等于0的个数，那么是顺子。</span></p>

#include "stdafx.h"#include "iostream"#include <set>#include <vector>using namespace std;void GetMaxMin(const set<int> & setNum, int &nMax, int &nMin){nMin = 13;nMax = 1;set<int>::const_iterator iter = setNum.begin();for (; iter != setNum.end();iter ++){if(*iter < nMin)nMin = *iter;if(*iter > nMax)nMax = *iter;}}int Del0Num(set<int> & setNum,const vector<int>& data){int Num0 = 0;vector<int >::const_iterator iter = data.begin();for (; iter != data.end();iter ++){if(*iter != 0)setNum.insert(*iter);else Num0++;}return Num0;}bool IsContinuous(vector <int> data){int nMax = 0, nMin = 0;set<int> setNum;int num0 = Del0Num(setNum, data);if (num0 + setNum.size() < data.size()){return false;}GetMaxMin(setNum,nMax,nMin);return nMax - nMin <=(int) (data.size())-1;}int _tmain(int argc, _TCHAR* argv[]){vector<int> vec;for (int i = 0; i < 5; i ++){int temp;cin>>temp;vec.push_back(temp);}cout<<IsContinuous(vec)<<endl;return 0;}

0 0