1,大数相减
大整数相减。有两个非常大的整数,因为太大所以用数组保存,计算大数相减的结果。
减法操作是需要提前判断出大一点的那个数的。
vector<string> bigint_subtraction(vector<int>& nums, int target) {
vector<int> A = {1,3,4,6,8};
vector<int> B = {1,3,4,6,9};
//将大的值变成A,小一些的值变成B
int asize = A.size(),bsize = B.size();
bool b_above_a = false;
if (bsize==asize) {
for (int i=0;i<asize;i++) {
if (B[i]>A[i]) {
b_above_a = true;
break;
}
}
}
if (b_above_a || bsize>asize) {
vector<int> temp = B;
B = A;
A = temp;
b_above_a = true;
}
//用大数减去小数,使用借位符查看是不是需要借位
int jieweifu = 0;
vector<int> result;
int i=A.size()-1,j=B.size()-1;
//A中的数减去B中的数
for (;j>=0;i--,j--) {
int num_a = A[i] - jieweifu;
int diff = num_a - B[j];
if (diff < 0) {
jieweifu = 1;
diff += 10;
}
else
jieweifu = 0;
result.push_back(diff);
}
//若A中的数还有,则继续跟进位符做判断
for (;i>=0;i--) {
int diff = A[i] - jieweifu;
if (diff < 0) {
jieweifu = 1;
diff += 10;
}
else
jieweifu = 0;
result.push_back(diff);
}
//将结果数组末尾的0去掉
for (int i=result.size()-1;i>0;i--) {
if (result[i]==0)
result.pop_back();
else
break;
}
//将结果数组反转,并根据正负加上符号;
vector<string> new_result;
if (b_above_a)
new_result.push_back("-");
for (int i=result.size()-1;i>=0;i--)
new_result.push_back(to_string(result[i]));
cout<<"new_result:";
for (int i=0;i<new_result.size();i++)
cout<<new_result[i];
return new_result;
}
2,大数相加
两个很大很大的正整数,将之保存在数组中,求两数相加之和
解题思路:解题思路:A,B和进位符相加,将余数保存起来,并更新进位符;将剩余的数组转变成A,将A继续与进位符一起遍历,并将结果数据保存起来。
vector<int> bignum_add() {
//大数相加
vector<int> A = {3,4,6,8};
vector<int> B = {6,3,4,6,9};
//大数和进位符相加
int jinweifu = 0;
vector<int> result;
int i=A.size()-1,j=B.size()-1,remainder;
for (;j>=0 && i>=0;i--,j--) {
int num_sum = A[i] + B[j] + jinweifu;
remainder = num_sum%10;
jinweifu = num_sum>=10?1:0;
result.push_back(remainder);
}
//默认A中数据比较大,若B的数据比较大,就把B赋值给A,然后A与进位符一起操作后加入到result
if (j>0) {
i=j;
A=B;
}
for (;i>=0;i--) {
int num_sum = A[i] + jinweifu;
remainder = num_sum%10;
jinweifu = num_sum>=10?1:0;
result.push_back(remainder);
}
//若最后一位计算完之后还有数据就在末尾加1
if (jinweifu>0)
result.push_back(1);
//将结果数据反转
vector<int> new_result;
for (int i=result.size()-1;i>=0;i--)
new_result.push_back(result[i]);
cout<<"new_result:";
for (int i=0;i<new_result.size();i++)
cout<<new_result[i];
return new_result;
}