
练习算法题
稳健的不高冷的强哥
这个作者很懒,什么都没留下…
展开
-
2.大斐波那契数
#include<iostream>#include<cstring>using namespace std;const int len = 1000;//每行为一个斐波那契数int arr[len][len]{ 0 };int main() { arr[1][0] = 1; arr[2][0] = 1; int n, dight = 0, temp; //dight 记录位数 cin >> n; ...原创 2021-12-08 19:36:27 · 119 阅读 · 0 评论 -
12.8汉诺塔
#include<iostream>#include<string>#include<vector>using namespace std;static long long times=0, n;//把全部盘子移到a-->cvoid Hanoi(size_t n, char a, char b, char c) { if (n == 1) { times += 2; }else { Hanoi(n...原创 2021-12-08 11:43:29 · 118 阅读 · 0 评论 -
2.字符串匹配1
#include<iostream>#include<string>using namespace std;int main() { /*11.28 字符串匹配*/ const int n = 3; string *strA = new string[n]; string *strB = new string[n]; int *count = new int[n] {}; for (int i = 0; i < ...原创 2021-11-28 16:23:46 · 226 阅读 · 0 评论 -
1.奇偶位互换
#include<iostream>#include<string>using namespace std;int main() { int n, temp; cin >> n; string *str = new string[n]; getchar(); for (int i = 0; i < n; i++) { getline(cin, str[i]); for (int j...原创 2021-11-28 16:16:12 · 437 阅读 · 0 评论