解题思路:
用官方数据跑应该是妥妥的超时的,可能是因为数据比较水吧,居然过了...
注意事项:
参考代码:
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <vector> #include <string> #include <queue> #include <algorithm> #include <stdio.h> #define N 27 using namespace std; vector<string> strSet; void DFS(char curAlpha,const char maxAlpha, string curStr, vector<string>& strSet, const int len, const string& startStr) { static int count; static bool gotStartStr = false; if (count >= 5) return; else if (curStr.length() == len) { strSet.push_back(curStr); if (curStr == startStr) gotStartStr = true; else if (gotStartStr) count += 1; return; } else if (curAlpha > maxAlpha) return; else { string bakStr = curStr; curStr += curAlpha; DFS(curAlpha + 1, maxAlpha, curStr, strSet, len, startStr); curStr = bakStr; DFS(curAlpha + 1, maxAlpha, curStr, strSet, len, startStr); } } int main(int argc, char** argv) { int s = 0, t = 0, len = 0; string startStr; cin >> s >> t >> len; cin >> startStr; string str; DFS('a' + s - 1, 'a' + t - 1, str, strSet, len, startStr); for (vector<string>::iterator it = strSet.end() - 5; it < strSet.end(); it++) cout << *it << endl; return 0; }
0.0分
0 人评分
C语言程序设计教程(第三版)课后习题12.3 (C语言代码)浏览:837 |
C语言训练-自由落体问题 (C语言代码)浏览:1739 |
矩阵乘法 (C++代码)浏览:1462 |
C语言程序设计教程(第三版)课后习题5.7 (C语言代码)浏览:615 |
C语言程序设计教程(第三版)课后习题5.7 (C语言代码)浏览:596 |
C语言程序设计教程(第三版)课后习题10.7 (C语言代码)浏览:547 |
C语言程序设计教程(第三版)课后习题7.3 (C语言代码)浏览:1196 |
简单的a+b (C语言代码)浏览:607 |
P1000 (C语言代码)浏览:877 |
C语言程序设计教程(第三版)课后习题5.6 (C语言代码)浏览:564 |