洛谷：P2142 高精度减法

b站视频：https://www.bilibili.com/video/BV1LA411v7mt?t=348&p=2
洛谷测题：https://www.luogu.com.cn/problem/P2142

题目描述
高精度减法。

输入格式
两个整数 a,ba,b（第二个可能比第一个大）。

输出格式
结果（是负数要输出负号）。

输入输出样例
输入 #1
2
1

输出 #1
1

import java.util.Scanner;

public class Main {
	
	//将输入得两个字符串s1 ->  字符数组num1[]  -> 转至后得字符数组end_num1[] 
	public static void main(String[] args) {
		Scanner inScanner = new Scanner(System.in);
		String s1 = inScanner.next();
		String s2 = inScanner.next();
		boolean flag = false;//判断两个数是否有交换
		
		//1.根据长度判断数字的大小，保证大的在是s1
		if(s1.length() < s2.length()) {
			flag = true;
			String temp = s1;
			s1 = s2;
			s2 = temp;
		}
		
		//2.如果两个字符串的长度相同，便逐个比较大小
		if(s1.length() == s2.length())
			for(int i = 0 ; i < s1.length();i++) {
				int s1_high = (int)s1.charAt(i);
				int s2_high = (int)s2.charAt(i);
				if(s1_high == s2_high) continue;
				else if(s2_high > s1_high) {
					flag = true;
					String temp = s1;
					s1 = s2;
					s2 = temp;
					break;
				}			
			}
	  	
		//3.字符串 -> 字符数组
		char[] num1 = s1.toCharArray();
		char[] num2 = s2.toCharArray();
		
		//4.字符数组 -> 转至新数组( index：1-s1.length()-1 )
		int[] end_num1 = new int[10088];
		int[] end_num2 = new int[10088];
		
		for(int i = 0; i < s1.length(); i++)
			end_num1[s1.length()-i] = num1[i] -'0';
		for(int i = 0; i < s2.length(); i++)
			end_num2[s2.length()-i] = num2[i] -'0';
		
		//5.定义最后结果的数组，index：1开始
		int end_len = s1.length()+1;
		int[] end_num3 = new int[end_len];
		
		for(int i = 1; i < end_len; i++) {
			if(end_num1[i] < end_num2[i]) {
				end_num1[i]+=10;
				end_num1[i+1]--;
			}
			end_num3[i] = end_num1[i] - end_num2[i];
			
		}
		
		//去掉前驱0
		int index = end_len-1;
		while(end_num3[index] == 0 && index > 1) {
			index--;
		}
		
		//如果有交换两个数，便证明s1<s2，输出负号
		if(flag) System.out.print("-");
		for(int i = index ; i > 0; i--)
			System.out.print(end_num3[i]);
	}
}