浙工大15新生赛 JLB A+B

lunaArcher

于 2016-12-16 14:10:23 发布

阅读量446

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/lunaArcher/article/details/53692402

本文介绍了一个使用栈来实现两个字符串形式的大整数相加的算法。该算法首先将输入的两个字符串调整到相同的长度，然后从最低位开始逐位相加，并处理进位的情况。最后通过一个栈来逆序输出结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
#include <string>
#include <stack>
#include <algorithm>
using namespace std;
int main() {
	string Lu, Hui, Zheng, Yi;
	stack<int> q;
	while (cin >> Lu >> Hui && EOF) {
		int l1 = Lu.length() - 1, l2 = Hui.length() - 1;
		if (l1 >= l2) {
			Yi = Lu;
			Zheng = Lu;
			for (int i = 0; i <= l1 - l2; i++)
				Yi[i] = '0';
			for (int i = l1 - l2, j = 0; j <= l2; j++, i++)
				Yi[i] = Hui[j];
			for (int i = 0; i <= l1; i++)
				Zheng[i] = Lu[i];
		}
		if (l2 > l1) {
			Yi = Hui;
			Zheng = Hui;
			for (int i = 0; i <= l2 - l1; i++)
				Yi[i] = '0';
			for (int i = l2 - l1, j = 0; j <= l1; j++, i++)
				Yi[i] = Lu[j];
			for (int i = 0; i <= l2; i++)
				Zheng[i] = Hui[i];
		}
		int i, w = 0;
		int e = max(l1, l2);
		for (i = e; i >= 0; i--) {
			int x = Zheng[i] - '0' + w, y = Yi[i] - '0';
			if (x + y < 10) {
				q.push(x + y);
				w = 0;
			}
			else {
				q.push((x + y) % 10);
				w = 1;
				if (i == 0)
					q.push(1);
			}
		}
		while (!q.empty()) {
			int r = q.top(); q.pop();
			printf("%d", r);
		}
		printf("\n");
	}
	return 0;
}