java实现两个很大的数相加

package com.mine.main;

/**
 * 很大很大的两个数相加（可能超出int，也可能超出long）
 *
 * @author niezhenjie
 *
 */
public class BigNumber {

	public static void main(String[] args) {
		long start = System.currentTimeMillis();
		String s1 = "138527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864139527864";
		String s2 = "190052786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786413952786";
		String s3 = s1 + s2;
		// String s1 = "0";
		// String s2 = "0";
		System.out.println(s1.length());
		String ret = null;
		System.out.println(ret = BigNumber.add(s1, s3));
		System.out.println(System.currentTimeMillis() - start);
		System.out.println(ret.length());

	}

	public static String add(String num1, String num2) {
		if (null == num1 || num1.trim().length() == 0) {
			num1 = "0";
		}
		if (null == num2 || num2.trim().length() == 0) {
			num2 = "0";
		}
		int add = 0; // 满10进1
		int maxLength = Math.max(num1.length(), num2.length());
		// 两个数相加，和的位数最多是两个数中最大的数的+1位 ,如999+999，结果是4位
		char[] ret = new char[maxLength + 1];
		int len1 = num1.length() - 1;
		int len2 = num2.length() - 1;
		for (int j = 0; j < ret.length; j++) {
			String r1, r2;
			if (len1 - j < 0 && len2 - j < 0 && add == 0) {
				break;
			}
			// len1比len2小，不足位用0代替
			if (len1 - j < 0) {
				r1 = "0";
			} else {
				r1 = String.valueOf(num1.charAt(len1 - j));
			}
			if (len2 - j < 0) {
				r2 = "0";
			} else {
				r2 = String.valueOf(num2.charAt(len2 - j));
			}
			int i1 = Integer.parseInt(r1);
			int i2 = Integer.parseInt(r2);
			// 两位相加再加上进位就是该位置的结果了
			ret[j] = String.valueOf((i1 + i2 + add) % 10).charAt(0);
			// 满十进1
			add = (i1 + i2 + add) / 10;

		}
		// 反转过来的结果才是最终的运算结果
		reverse(ret);
		return String.valueOf(ret).trim();
	}

	public static void reverse(char[] chars) {
		if (null == chars) {
			return;
		}
		for (int j = 0; j < chars.length >> 1; j++) {
			char temp = chars[j];
			chars[j] = chars[chars.length - 1 - j];
			chars[chars.length - 1 - j] = temp;
		}
	}

}