步骤
① 大整数存储 与之前高精度加法的 存储过程一样
②进行模拟运算
A[3] A[2] A[1] A[0]
- B[2] B[1] B[0]
-----------------------
C[2] C[1] C[0]
首先保证A > B
A[I] - B[I] - t ① >= 0 直接减
② < 0 A[i] - B[i] - t + 10
t为上一位的借位值
题目
大整数减法 求 A - B
#include <iostream>
#include <vector>
using namespace std;
bool cmp(vector<int> &A, vector<int> &B)
{
if(A.size() != B.size()) return A.size() > B.size();
for (int i = A.size() - 1; i >= 0; i --)
if(A[i] != B[i])
return A[i] > B[i];
return true;
}
vector<int> sub (vector<int> &A, vector<int> &B)
{
vector<int> C;
int t = 0;
for (int i = 0; i < A.size(); i ++)
{
t = A[i] - t;
if (i < B.size()) t -= B[i];
C.push_back((t + 10) % 10);
if (t < 0) t = 1;
else t = 0;
}
while (C.size() > 1 & C.back() == 0) C.pop_back();
return C;
}
int main()
{
string a, b;
vector<int> A, B;
cin >> 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');
if (cmp(A, B))
{
auto C = sub(A, B);
for(int i = C.size() - 1; i >=0; i--) cout<<C[i];
}
else
{
auto C =sub(B, A);
cout << '-';
for(int i = C.size() - 1; i >=0; i--) cout<<C[i];
}
system("pause");
return 0;
}