解题思路:
逆转字符串 → 相加 → 进位 → 逆序输出
参考代码:
#include<iostream> #include<cstring> using namespace std; void change(char *num) { char *start = num, *end = num + strlen(num) - 1; while (start < end) { char temp = *start; *start++ = *end; *end-- = temp; } } int main() { char n[1000], m[1000]; int r[1001]; while (cin >> n >> m) { memset(r, 0, sizeof(int) * 1001); change(n); change(m); int size1, size2; char *big = NULL; if (strlen(n) < strlen(m)) { size1 = strlen(n); size2 = strlen(m); big = m; } else { size1 = strlen(m); size2 = strlen(n); big = n; } int i; for (i = 0; i < size1; i++) r[i] = n[i] + m[i] - '0' - '0'; for (; i < size2; i++) r[i] = big[i] - '0'; int p = 0; while (p < size2 + 1) { if (r[p] > 9) { r[p + 1] += r[p] / 10; r[p] %= 10; } p++; } int pos; for (pos = 1000; pos >= 0; pos--) if (r[pos] != 0) break; for (int i = pos; i >= 0; i--) cout << r[i]; cout << endl; memset(n, 0, sizeof(char) * 1000); memset(m, 0, sizeof(char) * 1000); } return 0; }
0.0分
0 人评分