AcWing 792. 高精度减法
原题链接
简单
作者:
XiaoLaji
,
2021-06-24 03:12:03
,
所有人可见
,
阅读 205
C++ 代码
#include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;
vector<int> sub(vector<int> &A , vector<int> &B){
vector<int> res;
int t = 0;
if(B.size() > A.size())return sub(B, A);
for(int i = 0; i<A.size() || t ;i++){
t = A[i] - t;
if(i<B.size()) t -= B[i];
res.push_back((t + 10) % 10);
if(t < 0) t = 1;
else t = 0;
}
while(res.size() > 1 && res.back() == 0)res.pop_back();
return res;
}
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];
}
}
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 Res = sub(A, B);
for(int i = Res.size() - 1; i>=0; i--){
printf("%d",Res[i]);
}
} else{
auto Res = sub(B, A);
if(Res.size() == 1 && Res[0] == 0){
printf("%d", Res[0]);
}
else{
printf("-");
for(int i = Res.size() - 1; i>=0; i--){
printf("%d", Res[i]);
}
}
}
}