1144A A. Diverse Strings（set的应用）

A string is called diverse if it contains consecutive (adjacent) letters of the Latin alphabet and each letter occurs exactly once. For example, the following strings are diverse: “fced”, “xyz”, “r” and “dabcef”. The following string are not diverse: “az”, “aa”, “bad” and “babc”. Note that the letters ‘a’ and ‘z’ are not adjacent.

Formally, consider positions of all letters in the string in the alphabet. These positions should form contiguous segment, i.e. they should come one by one without any gaps.

You are given a sequence of strings. For each string, if it is diverse, print “Yes”. Otherwise, print “No”.

Input
The first line contains integer n (1≤n≤100), denoting the number of strings to process. The following n lines contains strings, one string per line. Each string contains only lowercase Latin letters, its length is between 1 and 100, inclusive.

Output
Print n lines, one line per a string in the input. The line should contain “Yes” if the corresponding string is diverse and “No” if the corresponding string is not diverse. You can print each letter in any case (upper or lower). For example, “YeS”, “no” and “yES” are all acceptable.

Example
input
8
fced
xyz
r
dabcef
az
aa
bad
babc
output
Yes
Yes
Yes
Yes
No
No
No
No
题目大意： 给定n个字符串，判断该字符串是否是连续的（每个字符只能出现一次，顺序可为乱序，且该字符串是连续的几个字符组成的）
思路： 利用set容器，字符为一个时，显然满足条件，多个时用set插入每个字符，比较其字符个数与一开始的字符串长度是否一致，不一致输出No，一致时再找出该字符串的最大字符和最小字符，两个做减法，看其结果是否为set容器大小减一，是则输出Yes，否则输出No。

#include <iostream>
#include <cstring>
#include <set>
using namespace std;
int main() {
	int n;
	scanf("%d", &n);
	getchar(); // 获取换行符 
	string ss;
	while(n--) {
		getline(cin, ss);
		set<char> s;
		if(ss.size() == 1) { // 单个字符，直接输出Yes 
			printf("Yes\n");
			continue;
		}
		for(int i = 0; i < ss.size(); i++) { // 字符个数不为1，用set存储 
			s.insert(ss[i]);
		}
		if(ss.size() != s.size()) { // 出现重复字符直接输出No 
			printf("No\n");
		} else {
			int flag = 0;
			char c1 = 'a', c2 = 'z';
			for(int i = 0; i < ss.size(); i++) {
				if(ss[i] <= c2) c2 = ss[i]; // 找出最小的字符 
				if(ss[i] >= c1) c1 = ss[i]; // 找出最大的字符 
			}
			if(c1 - c2 == s.size() - 1) flag = 1; // 判断是否是连续的字符组成的字符串，用最大的字符减最小的，其结果为容器大小减一就说明是连续的 
			if(flag) printf("Yes\n");
			else printf("No\n");
		}
	}
	return 0;
}