/* * Author: AZTECCO 02/2018 * * EDITED: added Deck::snapCorrect() * find pairs in sequence * * NOTE: the old Deck::snap() * didnt matched the challenge quest. * */ /* 🃏Card Snap [Challenge]🃏 Hey Shuffle 52 cards and run through the deck to find out how many snaps/pairs there are in the deck as follows. first 20 cards of a shuffled deck. A,A,3,4,2,6,8,8,8,8,J,J,K,A,6,Q,Q,Q,A,4 running through the deck to find pairs in order. snap 1 was AA snap 2 was 88 snap 3 was 88 snap 4 was JJ snap 5 was QQ Challenge by D_Stark */ #include #include #include #include class Card ; class Deck ; class Card { public : void display() { std::cout<< depiction_ ; } private : Card( int seed , int value ) : seed_( seed ) , value_( value ) , depiction_( make() ) { // Initializer only } ~Card() { std::cout<< "~"; // #DEBUG } Card( Card& obj ) = delete ; void operator =( Card& obj ) = delete ; std::string make() ; // called in initializer const int seed_ ; const int value_ ; const std::string depiction_ ; friend class Deck; }; std::string Card::make() { std::string depiction= "["; // generates card value string switch ( value_ ) { case 1 : depiction += 'A'; depiction += ' '; break ; case 2 : // fall trough case 2 to 9 : has same behaviour case 3 : case 4 : case 5 : case 6 : case 7 : case 8 : case 9 : depiction += char ( 48 + value_ ) ; depiction += ' '; break ; case 10 : depiction += '1'; depiction += '0'; break ; case 11 : depiction += 'J'; depiction += ' '; break ; case 12 : depiction += 'Q'; depiction += ' '; break ; case 13 : depiction += 'K'; depiction += ' '; break ; default : std::cout<< "\n. ! wrong parameter !\n"; } // generates card seed string switch ( seed_ ) { case 0 : depiction += 's'; break ; case 1 : depiction += 'd'; break ; case 2 : depiction += 'c'; break ; case 3 : depiction += 'h'; break ; default : std::cout<< "\n. ! wrong parameter !\n"; } depiction += ']'; return depiction ; } class Deck { public : Deck() { std::cout<< "\nNewDeck\n" ; for (int i = 0 ; i < 52 ; i++ ) deck_.push_back( new Card( i / 13 , i % 13 + 1 ) ) ; } ~Deck() { std::cout<< "~Deck\n"; int i = 1; // #DEBUG for items count for ( std::vector::iterator it = deck_.begin() ; it != deck_.end() ; it++ ){ delete (*it) ; std::cout<< i++; // #DEBUG combined to item ~ } } void shuffle(int); void snap(); void snapCorrect(); void show(int); void choose( int x ) { ( deck_[x-1] )->display() ; } private: std::vector deck_ ; Deck( Deck& obj ) = delete ; void operator =( Deck& obj ) = delete ; }; void Deck::show( int howMany = 52 ) { if ( 0 > howMany || 52 < howMany ) // bound check howMany = 52 ; std::cout<< "==> SHOW " ; if ( howMany == 52 ) std::cout<< "ALL" ; else std::cout<< howMany ; std::cout<< std::endl; for ( int i = 0 ; i < howMany ; i++ ) { ( deck_[i] )->display() ; if ( 7 == i % 8 ) std::cout<< std::endl ; } std::cout<< std::endl ; } void Deck::shuffle( int times = 1 ) { // param check if ( 1 > times || 30 < times ) times = 1 ; std::cout<< "\n==>SHUFFLE " ; if ( 1 < times ){ std::cout<< times << " times." ; } for ( ; times >= 0 ; times-- ) { // cut deck in 2 pieces std::vector blockA ; std::vector blockB ; int cutAt = std::rand()%40 + 6 ; for ( int i = 0 ; i < cutAt ; i++ ) blockA.push_back( deck_[i] ) ; for ( int i = cutAt ; i < 52 ; i++ ) blockB.push_back( deck_[i] ) ; deck_.clear() ; bool wantFromA ; std::vector::iterator itBlockA = blockA.begin() ; std::vector::iterator itBlockB = blockB.begin() ; for ( int i = 0 ; i < 52 ; i++ ) { // choose from wich half get the next Card if ( itBlockA == blockA.end() ) wantFromA = false ; else { if ( itBlockB == blockB.end() ) wantFromA = true ; else wantFromA = std::rand() % 2 ; } // get the choosen Card and put in list if ( wantFromA ){ deck_.push_back( *itBlockA ) ; itBlockA++ ; } else { deck_.push_back( *itBlockB ) ; itBlockB++ ; } } } std::cout<< std::endl; } void Deck::snap() { int snapNo = 0 ; std::vector appearedCards; for ( int i = 0 ; i < 20 ; i++){ bool isPairFound = false ; for ( std::vector::iterator it = appearedCards.begin() ; it != appearedCards.end() ; it++ ) { if ( isPairFound == true ) break ; if ( (*it)->value_ == (deck_[i])->value_ ){ snapNo++ ; std::cout<< "SNAP " << snapNo << " was " ; (*it)->display() ; (deck_[i])->display() ; std::cout<< std::endl ; appearedCards.erase(it) ; isPairFound = true; } } if ( isPairFound == false ) appearedCards.push_back(deck_[i]); } } void Deck::snapCorrect() { int snapNo = 0 ; int valueComparsion = 0 ; bool isSometinFound = false ; for ( int i = 0 ; i < 20 ; i++) { if ( valueComparsion == ( deck_[ i ] )->value_ ) { valueComparsion = 0 ; isSometinFound = true ; snapNo++ ; std::cout<< "SNAP " << snapNo << " was " ; ( deck_[ i - 1 ] )->display() ; ( deck_[ i ] )->display() ; std::cout<< std::endl ; } else valueComparsion = ( deck_[ i ] )->value_ ; } if ( isSometinFound == false ) std::cout<< "No pairs found.\n" ; } int main() { std::srand(std::time(0)) ; Deck A ; A.show() ; A.shuffle( rand() % 10 ) ; A.show() ; std::cout<< std::endl ; std::cout<< std::endl ; A.show( 20 ) ; std::cout<< std::endl ; A.snapCorrect() ; std::cout<< std::endl ; std::cout<< std::endl ; std::cout<< "END\n" ; return 0; }