src/com/problems/Question25.java
private BigInt removeStartZeros(BigInt b) {
		int numberOfSartZeros = 0;
		int [] intArray = b.getIntArray();
		
		for (int i = 0; i < intArray.length; i++) {
			if (intArray[i] > 0) {
				numberOfSartZeros = i;
				break;
			}
		}
		int newLength = intArray.length - numberOfSartZeros;
		
		int [] newArray = new int [newLength];
		for (int i = 0; i < newLength; i++) {
			newArray[i] = intArray[numberOfSartZeros + i];
		}
		BigInt newResult = new BigInt(newArray);
		b = null;
		return newResult;
	}
/*
	 * while adding two big int numbers , sometimes zero could be inserted in the start. remove them.
	 */
while adding two big int numbers , sometimes zero could be inserted in the start. remove them.
while adding two big int numbers sometimes zero could be inserted in the start . remove them .
private BigInt removeStartZeros(BigInt b) {
		int numberOfSartZeros = 0;
		int [] intArray = b.getIntArray();
		for (int i = 0; i < intArray.length; i++) {
			if (intArray[i] > 0) {
				numberOfSartZeros = i;
				break;
			}
		}
		int newLength = intArray.length - numberOfSartZeros;
		int [] newArray = new int [newLength];
		for (int i = 0; i < newLength; i++) {
			newArray[i] = intArray[numberOfSartZeros + i];
		}
		BigInt newResult = new BigInt(newArray);
		b = null;
		return newResult;
	}
private BigInt removeStartZeros ( BigInt b ) { int numberOfSartZeros = 0 ; int [ ] intArray = b . getIntArray ( ) ; for ( int i = 0 ; i < intArray . length ; i ++ ) { if ( intArray [ i ] > 0 ) { numberOfSartZeros = i ; break ; } } int newLength = intArray . length - numberOfSartZeros ; int [ ] newArray = new int [ newLength ] ; for ( int i = 0 ; i < newLength ; i ++ ) { newArray [ i ] = intArray [ numberOfSartZeros + i ] ; } BigInt newResult = new BigInt ( newArray ) ; b = null ; return newResult ; }
while adding two big int numbers , sometimes zero could be inserted in the start.
while adding two big int numbers sometimes zero could be inserted in the start .