高精度加减法

!: 加法面向 两正数;
减法面向 两正数且 a > b;
其余均需额外简单处理。

#include<iostream>
#include<stdlib.h>
#include<string.h>  //memset头文件;
using namespace std;

struct bign{
    int d[1000];
    int len;
    bign(){
        memset(d, 0, sizeof(d));
        len = 0;
    }
};

bign change(char str[]){
    bign a;
    a.len = strlen(str);
    for(int i = 0; i < a.len; i++){
        a.d[i] = str[a.len - i - 1] - '0';
    }
    return a;
}

bign add(bign a, bign b)
{
    bign c;
    int carry = 0;
    for(int i = 0; i < a.len || i < b.len; i++)
    {
        int tmp = a.d[i] + b.d[i] + carry;
        c.d[c.len++] = tmp % 10;
        carry = tmp / 10;
    }

    if(carry != 0)
    {
        c.d[c.len++] = carry;
    }

    return c;
}

bign sub(bign a, bign b)
{
    bign c;
    for(int i = 0; i < a.len || i < b.len; i++)
    {
        if(a.d[i] < b.d[i])
        {
            a.d[i + 1] --;
            a.d[i] += 10;
        }

        c.d[c.len ++] = a.d[i] - b.d[i];
    }

    while(c.len - 1 >= 1 && c.d[c.len-1] == 0)
        c.len --;

    return c;
}

void print(bign a)
{
    for(int i = a.len - 1; i >= 0; i--)
        cout << a.d[i];
}

int main()
{
    char str1[1000], str2[1000];
    cin >> str1 >> str2;
    bign a = change(str1);
    bign b = change(str2);
    
    print(sub(a, b));

    system("pause");
    return 0;
}