蛇形字符串

#include"pch.h"
#include
#include
#include
#include
#include
#include
#include
using namespace std;

struct ss {
	int num;//记录该字符所有的单个蛇形字符串数
	int longest;//记录以该字符为首的最长的蛇形字符串
};

int main() {
	ss a[26];
	for (int i = 0; i <= 25; i++) {
		a[i].num = 0;
		a[i].longest = 0;
	}
	vector<char> v1,v2;
	char c; int total = 0;
	while (scanf_s("%c", &c)==1) {
		if (isalpha(c)) {
			if (c >= 'A'&&c <= 'Z') v1.push_back(c);
			else v2.push_back(c);
		}
		if (c == 10) break;
	}
	sort(v1.begin(), v1.end());
	sort(v2.begin(), v2.end());
	for (vector<char>::iterator it1 = v1.begin(); it1 != v1.end(); it1++) {
		for (vector<char>::iterator it2 = v2.begin(); it2 != v2.end(); it2++) {
			if ((*it1) + 32 == (*it2)) {
				(*it2) = NULL;
				a[(*it1)-65].num++;
				total++;
			}
		}
	}
	while (total) {
		for (int j = 0; j <= 25; j++) {
			a[j].longest = 0;
		}
		int i = 25, max = 1;
		for (; i >= 0; i--) {
			if (a[i].num > 0) {
				a[i].longest = 1;
				break;
			}
		}
		for (int j = i - 1; j >= 0; j--) {
			if (a[j].num > 0) {
				a[j].longest = a[j + 1].longest + 1;
				if (a[j].longest > max) {
					max = a[j].longest;
				}
			}
		}
		for (int j = 0; j <= 25; j++) {
			if (a[j].longest == max&&a[j].num>0) {
				for (int k = j; k <= j + max - 1; k++) {
					printf("%c%c", 'A' + k, 'A' + k + 32);
					a[k].longest = 0;
					a[k].num--;
				}
				total -= max;
				cout << endl;
			}
		}
	}
	return 0;
}