【C语言】大数相加代码

最新推荐文章于 2023-07-25 07:36:07 发布

努力学习小十二

最新推荐文章于 2023-07-25 07:36:07 发布

阅读量453

点赞数 1

文章标签： c语言蓝桥杯算法

本文链接：https://blog.csdn.net/Mrlie/article/details/124736862

版权

朋友问的，就写了一下，顺便记录记录

#include <stdio.h>

void add(char* a, char* b) {
	int ret[1024] = {0};
	int location = 0;
	int lentha = strlen(a);
	int lenthb = strlen(b);
	int lenth = lentha > lenthb ? lenthb : lentha;
	int uper = 0;
	int this = 0;
	for (int i = 1; i <= lenth; i++) {
		this = (a[lentha - i] - '0' + b[lenthb - i] - '0' + uper) % 10;
		uper = (a[lentha - i] - '0' + b[lenthb - i] - '0' + uper) / 10;
		ret[location++] = this;
	}
	if (lentha == lenthb && uper == 1) {
		ret[location++] = 1;
		location--;
		for (; location >= 0; location--)printf("%d", ret[location]);
		return;
	}
	if (lentha > lenthb) {
		for (int i = lenth+1; i <= lentha; i++) {
			this = (a[lentha - i] - '0'+ uper) % 10;
			uper = (a[lentha - i] - '0'+ uper) / 10;
			ret[location++] = this;
		}
	}
	else {
		for (int i = lenth + 1; i <= lenthb; i++) {
			this = (b[lenthb - i] - '0' + uper) % 10;
			uper = (b[lenthb - i] - '0' + uper) / 10;
			ret[location++] = this;
		}
	}
	if (uper == 1)ret[location++] = 1;
	location--;
	for (; location >= 0; location--)printf("%d", ret[location]);
}
int main() {
	add("534234555", "5555");
}