public int[] PlusOneReturn(int[] digits){
		int j = digits.length;
		int sum = 1;
		int end = 0;
		while(sum==1 && end<digits.length){
			digits[j-1] = digits[j-1] + 1;
			sum = digits[j-1]/10;
			digits[j-1]%=10;
			j--;
			end++;
		}
		if(end==digits.length && sum==1){
			int[] results = new int[end+1];
			results[0]=1;
			for(int i=1;i<end+1;i++){
				results[i] = digits[i-1];
			}
			return results;
		}else{
			return digits;
		}
	}