zoj 3490 string successor

最新推荐文章于 2023-09-18 22:43:30 发布

原创最新推荐文章于 2023-09-18 22:43:30 发布 · 936 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

ACM

本文介绍了一个C++程序，该程序实现了一个字符串继任者算法，能够找到给定字符串的下一个合法字符串，支持字母大小写及数字，并能处理特定的边界情况。

#include <cstdio> #include <cstdlib> #include <cassert> #include <string> #include <vector> using namespace std; const string lowers = "abcdefghijklmnopqrstuvwxyz"; const string uppers = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alphs = lowers + uppers; const string nums = "0123456789"; const string alphnums = alphs + nums; bool IsUpper(char c) { return 'A' <= c && c <= 'Z'; } bool IsLower(char c) { return 'a' <= c && c <= 'z'; } bool IsAlph(char c) { return IsUpper(c) || IsLower(c); } bool IsNum(char c) { return '0' <= c && c <= '9'; } bool IsAlphNum(char c) { return IsAlph(c) || IsNum(c); } string Successor(const string &str) { string ret = str; int i = ret.find_last_of(alphnums); if(i == string::npos) { ++(*ret.rbegin()); } else { int car = 1; while(car && i >= 0) { int radix; int d; if(IsUpper(ret[i])) { radix = 26; d = 'A'; } else if(IsLower(ret[i])) { radix = 26; d = 'a'; } else { assert(IsNum(ret[i])); radix = 10; d = '0'; } char n = (ret[i] - d + car) % radix + d; car = (ret[i] - d + car) / radix; ret[i] = n; while(car && --i >= 0 && !IsAlphNum(ret[i])) {} } if(car) { assert(i < 0); int k = ret.find_first_of(alphnums); assert(k != string::npos); if(IsUpper(ret[k])) { ret = ret.substr(0, k) + 'A' + ret.substr(k, ret.size()); } else if(IsLower(ret[k])) { ret = ret.substr(0, k) + 'a' + ret.substr(k, ret.size()); } else { assert(IsNum(ret[k])); ret = ret.substr(0, k) + '1' + ret.substr(k, ret.size()); } } } return ret; } int main() { /* printf("ASCIIs:/n"); for(int i=0; i<256; ++i) { printf("%d --> %c/n", i, char(i)); } while(true) {} */ int cs; scanf("%d", &cs); while(cs-- > 0) { char buf[1024]; int n; scanf("%s%d", buf, &n); string s = buf; while(n-- > 0) { s = Successor(s); printf("%s/n", s.c_str()); } printf("/n"); } return 0; }

标签

#string #c #include