习题6-9(uva-127)

最新推荐文章于 2021-04-06 17:09:46 发布

原创最新推荐文章于 2021-04-06 17:09:46 发布 · 124 阅读

0 ·

CC 4.0 BY-SA版权

算法入门第六章专栏收录该内容

23 篇文章

订阅专栏

这是一个C++实现的扑克牌排序算法，通过不断寻找相邻相同花色或数字的牌进行交换，直至所有牌堆只剩一叠。程序首先初始化牌堆，然后在循环中寻找并交换符合条件的牌，最后输出剩余牌堆的数量及其大小。

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
stack<char> cards[52];
unordered_map<string, unsigned char> mmp;

const char Color[4] = { 'C','D','H','S' };
const char Point[13] = { '2','3','4','5','6','7','8','9','T','J','Q','K','A' };

void Init() {
	for (int i = 0; i < 52; ++i) {
		while (!cards[i].empty()) cards[i].pop();
	}
}
unsigned char GetCardID(string& in) {
	return mmp[in];
}

int IsSame(char a, char b) {
	if (cards[a].empty() || cards[b].empty()) return 0;
	a = cards[a].top();
	b = cards[b].top();
	return ( (a & 0xf0) == (b & 0xf0) ) || ( (a & 0x0f) == (b & 0x0f) );
}

int GetLeft(int id, int cnt) {
	while (cnt--) {
		id--;
		while (id >=0 && cards[id].empty()) --id;
	}
	return id;
}
int GetNext(int a,int nEnd,int nAdd) {
	while (a >= 0 && a <= nEnd && cards[a].empty()) { a += nAdd; }
	return a;
}

int main()
{
	string in,base;
	for (int i = 0; i < 4; ++i) {
		in = Color[i];
		for (int j = 0; j < 13; ++j) {
			base = Point[j] + in;
			mmp[base] = i | (j << 4);
		}
	}
	
	while (cin>>in && in != "#") {
		int nStart = 0, nEnd = 51, next = 0, cnt = 0, isok = 1;
		Init();
		cards[0].push(GetCardID(in));
		for (int i = 1; i < 52; ++i) {
			cin >> in;
			cards[i].push(GetCardID(in));
		}

		while (isok) {
			isok = 0;
			next = nStart = GetNext(nStart, nEnd,1);
			while (next <= nEnd) {
				int three = GetLeft(next, 3);
				if (three >= 0 && IsSame(next, three)) {
					cards[three].push(cards[next].top());
					cards[next].pop();
					isok = 1;
					break;
				}
				int one = GetLeft(next, 1);

				if (one >= 0 && IsSame(next, one)) {
					cards[one].push(cards[next].top());
					cards[next].pop();
					isok = 1;
					break;
				}
				
				next = GetNext(next + 1, nEnd, 1);
			}
			nEnd = GetNext(nEnd, nEnd, -1);
		}
		
		for (int i = 0; i < 52; i++)
			if (!cards[i].empty()) ++cnt;

		if(cnt > 1)
			cout << cnt << " piles remaining:";
		else 
			cout << cnt << " pile remaining:";

		for (int i = 0; i < 52; i++)
		{
			if (!cards[i].empty()) cout << " " << cards[i].size();
		}
		cout << endl;
	}
	return 0;
}