add.java

PKU中一些数据结构基本算法题的java实现

package OTHERS;

import java.util.*;
import java.lang.reflect.Array;
import java.lang.*;

//高精度加法
public class ADD {
	static int MAX = 5;

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
        Scanner cin = new Scanner(System.in);
        String a = cin.next();
        String b = cin.next();
        int[] array1 = formatStr(a);
        int[] array2 = formatStr(b);
        int[] array = add(array1,array2);
        
        System.out.println(formatArr(array));

	}
	static private String formatArr(int[] array){
		int i;
		for(i=array.length-1;i>-1;i--){
			if(array[i]==0){
			}
			else break;
		}
		String str = "";
		StringBuilder sb = new StringBuilder("");
		for(;i>-1;i--) sb.append(array[i]);
		str = sb.toString();
		if(str.equals("")) str = "0"; 
		return str;
	}
	static private int[] add(int[] array1,int[] array2){
		int i;
		int[] array = new int[MAX+1];
		for(i=0;i<MAX;i++){
			int a = array1[i];
			int b = array2[i];
			array[i] = a+b;
		}
		for(i=0;i<MAX;i++){
			if(array[i]>=10){
				int a = array[i]%10;
				int b = array[i]/10;
				array[i+1]+=b;
				array[i]=a;
			}
		}
		return array;
	}
	static private int[] formatStr(String str){
		int[] array = new int[MAX];
		int length = str.length();
		int i,j;
		for(i=length-1,j=0;i>-1;i--,j++){
			array[j] = str.charAt(i)-'0';
		}
		for(i=length;i<MAX;i++){
			array[i] = 0;
		}
		return array;		
	}

}