用vector巧解高精度问题

解题思路:

注意事项:

参考代码:

#include<iostream>

#include <vector> 

using namespace std;

vector<int> add(vector <int> A, vector <int> B) 

{

vector <int> C;//定义和容器 

int t = 0;

for (int i = 0; i < A.size() || i < B.size(); i ++)

{

if (t < A.size()) t += A[i];

if (i < B.size()) t += B[i];

C.push_back(t % 10);

t /= 10;

}

if (t) C.push_back(1);//如果最高位有进位那必定是1 

return C;

}

int main()

{

    string a, b;

    cin >> a >> b;

    vector <int> A, B;

    for (int i = a.size() - 1; i >= 0; i -- ) A.push_back(a[i] - '0');//容器内按位数从低到高存储 

    for (int i = b.size() - 1; i >= 0; i -- ) B.push_back(b[i] - '0');

//    for (int i = 0; i < A.size(); i ++ )

//    cout << A[i];

vector<int> C;

C = add(A, B);

for (int i = C.size() - 1; i >= 0; i --) cout << C[i]; //倒过来输出，从最高位开始输出 

    return 0;

}