public class BigNumMultipy {
public static String bigNumMultipy(String num1,String num2){
StringBuffer result = new StringBuffer();
int num1l = num1.length();
int num2l = num2.length();
int[] arr = new int[num1l+num2l];
int n1 = 0;
int n2 = 0;
for (int i = 0; i <num1l; i++) {
n1 = Integer.valueOf(String.valueOf(num1.charAt(num1l-i-1)));//字符类型转化成整形。
int temp = 0 ;
for (int j = 0; j < num2l ; j++) {
n2 = num2.charAt(num2l-j-1) - '0';
temp = arr[i+j]+n1*n2+temp;
arr[i+j] = temp%10;
temp = temp/10;
}
arr[i+num2l] = temp;
}
int i = num1l + num2l - 1;
while(i>0&&arr[i] == 0){
i--;
}
while(i>=0){ //必须要有等于
result.append(arr[i--]);
}
return result.toString();
}
//15129
public static void main(String[] args) {
System.out.println(bigNumMultipy("123","123"));
}
}