题目描述
请编码实现一个命令行工具,用于实现两个任意大小的正整数的加法操作。
因为是任意大小的整数,所以可以使用String来保存数据,至少不可以直接使用基本数据类型,因为它们都有范围。
代码实现
code:
import java.util.Scanner;
public class Main {
public static void main(String[] args){
//1.获取数据
Scanner scan = new Scanner(System.in);
String s1 = scan.next();
String s2 = scan.next();
scan.close();
//2.取得数据最小长度,和最大长度
int min_length = 0;
int max_length = 0;
int[] result;
if(s1.length() < s2.length()){
min_length = s1.length();
max_length = s2.length();
//3.一个数组,用来保存计算的结果
result = new int[max_length+1];
//4.模拟计算过程:从低位向高位一直加,先加到最小长度处
int up_num = 0; //向高位进一
int i = 0;
for(i=0; i<min_length; i++){
int num1 = s1.charAt(s1.length()-i-1) - '0';
int num2 = s2.charAt(s2.length()-i-1) - '0';
int sum = num1 + num2 + up_num;
if(sum >= 10 ){
up_num = 1;
sum = sum%10;
}
result[i] = sum;
}
for(i=min_length; i<max_length; i++){
int temp = s2.charAt(s2.length()-i-1) - '0';
int sum = temp + up_num;
if(sum >= 10){
sum = sum%10;
up_num = 1;
}else{
up_num = 0;
}
result[i] = sum;
}
if(up_num == 1){
result[max_length] = 1;
}
}else{
min_length = s2.length();
max_length = s1.length();
//3.一个数组,用来保存计算的结果
result = new int[max_length+1];
//4.模拟计算过程:从低位向高位一直加
int up_num = 0; //是否向高位进一
int i = 0;
for(i=0; i<min_length; i++){
int num1 = s1.charAt(s1.length()-i-1) - '0';
int num2 = s2.charAt(s2.length()-i-1) - '0';
int sum = num1 + num2 + up_num;
if(sum >= 10 ){
up_num = 1;
sum = sum%10;
}
result[i] = sum;
}
for(i=min_length; i<max_length; i++){
int temp = s1.charAt(s1.length()-i-1) - '0';
int sum = temp + up_num;
if(sum >= 10){
sum = sum%10;
up_num = 1;
}else{
up_num = 0;
}
result[i] = sum;
}
//最后还有进位
if(up_num==1){
result[max_length] = 1;
}
}
//5. 输出结果
if(result[max_length] == 0){
max_length = max_length - 1;
}
for(int i = max_length; i>=0; i--){
System.out.print(result[i]);
}
}
}
TestData:
1 2
10 1
1 10
10 90
10 990
990 10
1 999
999 1
333 667
333 9667
9667 333
1111111111111111111111111111111111111111111111111111111111 9
9 1111111111111111111111111111111111111111111111111111111111
以上数据可以保证结果正确。
若有错误,还请指正。