Stack数据结构的特点后进先出的应用：大数据运算

package com.sxt.test;

import java.util.EmptyStackException;
import java.util.Scanner;
import java.util.Stack;

public class TestStack {

public static void main(String[] args) throws EmptyStackException {

Scanner in = new Scanner(System.in);
System.out.print("请输入第一个大数据：");
String number1 = in.next();
System.out.print("请输入第二个大数据：");
String number2 = in.next();
in.close();
bigNumberIncreament(number1, number2);

}

/**
* 计算大数据的和
* @param number1  大数据1
* @param number2  大数据2
*/
public static void bigNumberIncreament(String number1, String number2) {

char[] number1_c = number1.toCharArray();
char[] number2_c = number2.toCharArray();

Stack<Integer> number1_stack = new Stack<Integer>();
Stack<Integer> number2_stack = new Stack<Integer>();
StringBuilder sb = new StringBuilder(); //保存计算结果

//将大数据压栈
for (char c : number1_c) {
number1_stack.push(Integer.parseInt(c+""));

}
for (char c : number2_c) {
number2_stack.push(Integer.parseInt(c+""));

}

int length1 = number1.length();
int length2 = number2.length();
int jinwei = 0; //初始进位为0
//按照较大的大数据长度循环
for(int i = 0; i < (length1 > length2? length1 : length2) + 1; i++) {
int num1 = 0;
int num2 = 0;
try {
num1 = number1_stack.pop().intValue();
} catch (EmptyStackException e) {
num1 = 0; //空栈时，将当前位赋值为
}
try {
num2 = number2_stack.pop().intValue();
} catch (EmptyStackException e) {
num2 = 0; //空栈时，将当前位赋值为0
}

int sum = num1 + num2 +jinwei;
if(sum >= 10) {
jinwei  = 1;
sum = sum%10;
} else {
jinwei = 0;
}
sb.append(sum);

}
String result = sb.toString();
char[] sc = result.toCharArray();
if(sc[sc.length-1] != '0') {
for(int i=sc.length-1; i>=0; i--) {
System.out.print(sc[i]);
}
} else {
for(int i=sc.length-2; i>=0; i--) {
System.out.print(sc[i]);
}
}
}

}