java计算两个数相加,解决溢出问题

  • 输入:
  • 包含两个非负数 a 和 b,以空格分隔;a 和 b 保证小于 2^32.

  • 输出:
  • 你的输出是对一行数据处理的结果,也即 a+b 的结果。

  • 输入样例:233 666
  • 输出样例:899
import java.util.Stack;

public class mitest {
    public static String myTest(String line) {
        int j = -1;
        Stack<Integer> firstNumStack = new Stack<Integer>();
        Stack<Integer> secondNumStack = new Stack<Integer>();
        Stack<Integer> sum = new Stack<Integer>();
        for (int i = 0; i < line.length(); i++) {
            if (!Character.isDigit(line.charAt(i))) {
                j = j + 1;
                continue;
            } else if (j == -1) {
                firstNumStack.push(Integer.parseUnsignedInt(String.valueOf(line.charAt(i))));
            } else if (j > -1) {
                secondNumStack.push(Integer.parseUnsignedInt(String.valueOf(line.charAt(i))));
            }
        }
        int maxLen = 0;
        if (firstNumStack.size() >= secondNumStack.size()) {
            maxLen = firstNumStack.size();
        }
        else {
            maxLen = secondNumStack.size();
        }

        int carry = 0;
        int firstNum;
        int secondNum;
        int tmpSum;
        while (maxLen != 0) {
            try {
                 firstNum = firstNumStack.pop();
            } catch (Exception e1) {
                firstNum = 0;
            }
            try {
                secondNum = secondNumStack.pop();
            } catch (Exception e2) {
                secondNum = 0;
            }
            tmpSum = firstNum + secondNum + carry;
            carry = tmpSum / 10;
            sum.push(tmpSum - carry * 10);
            maxLen -- ;
        }
        if (carry != 0) {
            sum.push(carry);
        }
        StringBuffer stringBuffer = new StringBuffer();
        while (sum.size() != 0) {
            stringBuffer.append(String.valueOf(sum.pop()));
        }
        return stringBuffer.toString();
    }
    public static void main(String[] args)
    {
        System.out.println(myTest ("100 456909"));
    }
}
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值