目录
为什么要压位呢?当我们的一个数很大, 大到数组空间开不到那么多位了, 我们考虑压位来解决问题, 压多少位, 数组空间将变为多少分之一, 降低了空间复杂度, 时间复杂度与普通的高精度是一样的
压位算法相较于普通的高精度算法主要区别在于进制数(压几位就模十的几次方), 和储存(见代码)
大值 乘 大值:
题目链接:A*B Problem - 洛谷
# include <iostream>
# include <string>
# include <vector>
using namespace std;
string ch1;
string ch2;
vector<int> a;
vector<int> b;
const int N = 4010;
int c[N];
int mul(vector<int> a , vector<int> b)
{
for(int i = 0 ; i < a.size() ; i++)
{
for(int j = 0 ; j < b.size() ; j++)
{
c[i + j] += a[i] * b[j];
}
}
int i = 0;
for(; i < a.size() + b.size() + 5; i++)
{
c[i +1] += (c[i] / 10);
c[i] %= 10;
}
while(i > 0 && c[i] == 0)
{
i--;
}
return i;
}
int main()
{
cin >> ch1 >> ch2;
for(int i = ch1.size() - 1 ; i >= 0 ; i--)
{
a.push_back(ch1[i] - '0');
}
for(int j = ch2.size() - 1 ; j >= 0 ; j--)
{
b.push_back(ch2[j] - '0');
}
int d = mul(a,b);
for(int i = d ; i >= 0 ; i--)
{
printf("%d",c[i]);
}
printf("\n");
return 0;
}
高精度加法
#include <iostream>
#include <vector>
using namespace std;
vector<int> add(vector<int> &A, vector<int> &B)
{
if (A.size() < B.size()) return add(B, A);
vector<int> C;
int t = 0;
for (int i = 0; i < A.size(); i ++ )
{
t += A[i];
if (i < B.size()) t += B[i];
C.push_back(t % 10);
t /= 10;
}
if (t) C.push_back(t);
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');
auto C = add(A, B);
for (int i = C.size() - 1; i >= 0; i -- ) cout << C[i];
cout << endl;
return 0;
}
高精度减法
在比较大小的时候不可以用string直接比较,例如string中有:1210<19
#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;
for (int i = 0, t = 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');
vector<int> C;
if (cmp(A, B)) C = sub(A, B);
else C = sub(B, A), cout << '-';
for (int i = C.size() - 1; i >= 0; i -- ) cout << C[i];
cout << endl;
return 0;
}
高精度乘法
#include <iostream>
#include <vector>
using namespace std;
vector<int> mul(vector<int> &A, int b)
{
v