大数间的乘法计算--大数计算

前几天，朋友碰到了一个大数计算的问题，匆忙之下我写了一个出来。

代码说实话写的不怎么好，有点乱，先贴出来，然后过几天再改好，贴一下。

 

如计算：9999999999999  *　1234567890123

1. package test;
3. public class BigNumber {
4.     
5.     public static double[] d1 = {9,9,9,9,9,9,9,9,9,9,9,9,9};
6.     
7.     public static double[] d2 = {1,2,3,4,5,6,7,8,9,0,1,2,3};
8.     
9.     public static int[] calculate(double[] d1,double[] d2){
10.         
11.         int result_length = 0;
12.         
13.         int result_num = 0;
14.         
15.         double[]d1_temp = null;
16.         
17.         double[]d2_temp = null;
18.         
19.         int[] result_over = null;
20.         
21.         if(d1.length == d2.length){
22.             
23.             result_length = d1.length;
24.             
25.             result_num = result_length;
26.             
27.             d1_temp = d1;
28.             
29.             d2_temp = d2;
30.             
31.         } else {
32.             
33.             result_length = ( d1.length  >= d2.length )? d1.length : d2.length;
34.             
35.             result_num = ( d1.length  <= d2.length )? d1.length : d2.length;
36.             
37.             d1_temp = ( d1.length  <= d2.length )? d1 : d2;
38.             
39.             d2_temp = ( d1.length  >= d2.length )? d1 : d2;
40.             
41.         }
42.         
43.         double[][] result = new double[ result_num ][ result_length + 1 ];
44.         
45.         int temp = 0;
46.         
47.         for(int i = result_num - 1 ; i >= 0 ; i-- ){
48.             
49.             for(int j = result_length - 1 ; j >= 0 ; j-- ){
50.                 
51.                 temp += ( int ) ( d1_temp[ i ] * d2_temp[ j ] );
52.                 
53.                 result[i][ j + 1 ] = temp % 10;
54.                 
55.                 temp = temp / 10;
56.                           
57.             }
58.             
59.             result[ i ][ 0 ] = temp;
60.                       
61.             temp = 0;
62.             
63.         }
64.         
65.         temp = 0;
66.         
67.         int flag = 0;
68.         
69.         result_over = new int[result_num + result_length ];
70.         
71.         int line_flag = result_over.length - 1;
72.             
73.             for( int m = result[0].length - 1  ; m >=0 ; m-- ){
74.                 
75.                 flag = m;
76.                 
77.                 for( int n = result.length - 1  ; n >=0 ; n-- ){
78.                     
79.                     if(  flag <= ( result[n].length - 1 )){
80.                         
81.                         temp += result[n][flag];
82.                         
83.                     } else {
84.                         
85.                         break;
86.                         
87.                     }
88.                     
89.                     flag++;
90.                     
91.                 }
92.                 
93.                 result_over[line_flag--] = temp % 10;
94.                 
95.                 temp = temp / 10;
96.                 
97.                 if(m == 0){
98.                     
99.                     if(result.length >= 2){
100.                         
101.                         for(int a = result.length - 2; a >= 0 ; a-- ){
102.                             
103.                             flag = 0;
104.                             
105.                             temp += result[a][flag++];
106.                             
107.                             for(int b = a - 1; b >= 0 ; b--){
108.                                 
109.                                 if( flag <= (result[b].length - 1) ){
110.                                     
111.                                     temp  += result[b][flag];
112.                                     
113.                                 } else {
114.                                     
115.                                     break;
116.                                     
117.                                 }
118.                                 
119.                                 flag++;
120.                                 
121.                             }
122.                             
123.                             result_over[line_flag--] = temp % 10;
124.                             
125.                             temp = temp / 10;
126.                             
127.                         }
128.                         
129.                     }
130.                     
131.                 }
132.                 
133.             }
134.         
135.         
136.         return result_over;
137.         
138.     }
139.     
140.     public static void main(String[] args) {
141.         
142.         int[] d_result = calculate(d1,d2);
144.         for(int i = 0; i < d_result.length ; i++ ){//输出结果
145.             
146.             System.out.print(" " + d_result[i] + " ");
147.             
148.         }
149.         
150.         
151.     }
153. }

 

-----------------------

结果为： 1  2  3  4  5  6  7  8  9  0  1  2  2  8  7  6  5  4  3  2  1  0  9  8  7  7