Who is this guy providing bad solution when Pete gave nice solution :) People dont read what other guy wrote and how there solution compare. rediculous.

public int[] addBigInt(int[] a, int[] b){ int[] result = new int[Math.max(a.length,b.length)+1]; int aindex=a.length-1; int bindex=b.length-1; int rindex=result.length-1; int carry=0; int temp=0; while(aindex>=0 || bindex>=0 || rindex>=0){ if(bindex<0 && aindex<0){ temp=0+carry; } else if(aindex<0){ temp=b[bindex]+carry; } else if(bindex<0){ temp=a[aindex]+carry; } else{ temp=a[aindex]+b[bindex]+carry; } carry=temp/10; temp=temp%10; result[rindex]=temp; aindex--; bindex--; rindex--; } return result; }

The above can be simplified further for sure, just a basic solution I knocked up

E.g. ['1','2','3']+['2','9']=['1', '5', '2']

JAVA Code: package com.google.testing; public class BigIntegerOperations { /** * @param args */ public static void main(String[] args) { int[] number1 = {4,5,7,0}; int[] number2 = {5,0,7,0}; System.out.println(add(number1,number2)); } private static int add(int[] number1, int[] number2) { int num1 = getNumber(number1); int num2 = getNumber(number2); return num1+num2; } private static int getNumber(int[] arrayNumber) { int number = arrayNumber[arrayNumber.length-1]; for(int i=arrayNumber.length-2,j=1;i>=0;i--,j++) number+=(arrayNumber[i]*(getMultiple(j))); return number; } private static int getMultiple(int times) { int number = 1; for(int i=0;i