1.高精度加法
C++代码板子:
// C = A + B, A >= 0, B >= 0
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;
}
Java版本板子:
public static List<Integer> add(String a,String b){
int i=a.length()-1;
int j=b.length()-1;
List<Integer> temp=new ArrayList<>();
int t=0;//用来进位的
for(;i>=0||j>=0;i--,j--){//从个位数开始相加
t+=(i>=0?a.charAt(i)-'0':0);//i超出了a的位数就取零
t+=(j>=0?b.charAt(j)-'0':0);
temp.add(t%10);
t=t/10;
}
if(t>0) temp.add(t);//如果最后t==1就加上
return temp;//此时的temp是逆序的,最后要在方法外逆序输出
}
2.高精度加法
C++板子:
// C = A - B, 满足A >= B, A >= 0, B >= 0
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;
}
Java的话可以直接使用大整形:
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
BigInteger a = sc.nextBigInteger();
BigInteger b = sc.nextBigInteger();
BigInteger cnt = a.subtract(b);
System.out.println(cnt);
}
}
如果使用Java代码的板子:
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
//判断A和B的大小
public static boolean cmp(ArrayList<Integer> A,ArrayList<Integer> B){
if (A.size()!=B.size()) return A.size()>B.size();
for (int i = A.size() - 1; i >= 0; i -- )
if (A.get(i) != B.get(i))
return A.get(i) > B.get(i);
return true;
}
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
String a,b;
ArrayList<Integer> A=new ArrayList<>();
ArrayList<Integer> B=new ArrayList<>();
a=scanner.next();
b=scanner.next();
for (int i = a.length() - 1; i >= 0; i -- ) A.add(a.charAt(i) - '0');
for (int i = b.length() - 1; i >= 0; i -- ) B.add(b.charAt(i) - '0');
ArrayList<Integer> C=null;
if (cmp(A,B)) {//判断A和B的大小
C=sub(A,B);//A大于B
}else
{
C=sub(B,A);
System.out.print("-");
}
for (int i = C.size() - 1; i >= 0; i -- )
System.out.print(C.get(i));
System.out.println();
}
//相减操作
private static ArrayList<Integer> sub(ArrayList<Integer> A, ArrayList<Integer> B) {
ArrayList<Integer> C=new ArrayList<>();
for (int i = 0,t=0; i <A.size() ; i++) {
t=A.get(i)-t;
if(i<B.size())t-=B.get(i);
C.add((t+10)%10);
if (t<0)t=1;
else t=0;
}
while (C.size()>1&&C.get(C.size()-1)==0)C.remove(C.size()-1);
return C;
}
}
3.高精度乘低精度
C++板子:
// C = A * b, A >= 0, b >= 0
vector<int> mul(vector<int> &A, int b)
{
vector<int> C;
int t = 0;
for (int i = 0; i < A.size() || t; i ++ )
{
if (i < A.size()) t += A[i] * b;
C.push_back(t % 10);
t /= 10;
}
while (C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}
4.高精度除以低精度
C++板子:
// A / b = C ... r, A >= 0, b > 0
vector<int> div(vector<int> &A, int b, int &r)
{
vector<int> C;
r = 0;
for (int i = A.size() - 1; i >= 0; i -- )
{
r = r * 10 + A[i];
C.push_back(r / b);
r %= b;
}
reverse(C.begin(), C.end());
while (C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}