程序设计综合实践 1.9

有符号大数加、减运算。请在样例程序Ex1.4基础上实现无符号大数比较运算(小于、小于等于、等于、大于、大于等于)，并进一步实现有符号大数的加、减运算。题目要求输入两个有符号大数，输出它们的和、差。

输入格式:
两个有符号大数。

输出格式:
两个有符号大数，每个一行，正号不输出。

输入样例:	-1234567890987654321333888999666 147655765659657669789687967867
输出样例:	-1086912125327996651544201031799 -1382223656647311991123576967533

作者	李卫明
单位	杭州电子科技大学
代码长度限制	16 KB
时间限制	400 ms
内存限制	64 MB

Java版本：

import java.util.ArrayList;
import java.util.Scanner;

public class BigNumber2 {
    public static int singed_Compare(String a,String b){
        //1表示 a>b 0表示 a<b
        int count=0;
        if( a.contains("-") && !b.contains("-")) return 0;
        else if( !a.contains("-") && b.contains("-") ) return 1;
        else if(!a.contains("-") && !b.contains("-")){
            if(a.length()>b.length())return 1;
            else if(a.length()<b.length()) return 0;
            else if(a.length()==b.length()){
                int[] int_arr1 = split_Number(a);
                int[] int_arr2 = split_Number(b);
                for (int i = int_arr1.length-1; i >=0 ;i--) {
                    if(int_arr1[i]>int_arr2[i])return 1;
                    else if (int_arr1[i]<int_arr2[i])return 0;
                }
            }
        }else if(a.contains("-") && b.contains("-")){
            if(a.length()>b.length())return 0;
            else if(a.length()<b.length()) return 1;
            else if( a.length()==b.length() ){
                int[] int_arr1 = split_Number(a);
                int[] int_arr2 = split_Number(b);
                for (int i = int_arr1.length-2; i >=0 ;i--) {
                    if(int_arr1[i]>int_arr2[i])return 0;
                    else if (int_arr1[i]<int_arr2[i])return 1;
                }
            }
        }
     return count;
    }
    public static void signed_Add(String a,String b){

        if(!a.contains("-") && !b.contains("-")){
            int[] int_arr1 = split_Number(a);
            int[] int_arr2 = split_Number(b);
            bigNumber_add(int_arr1,int_arr2);
        }else if( (!a.contains("-")&&b.contains("-")) || (a.contains("-")&&!b.contains("-")) ){
            //判断a,b的大小
            int flag = singed_Compare(a,b);
            if(a.contains("-"))a=a.replace("-","");
            else b=b.replace("-","");
            int[] int_arr1 = split_Number(a);
            int[] int_arr2 = split_Number(b);
            if(singed_Compare(a,b)==1) {
                if(flag==1)
                    bigNumber_sub(int_arr1,int_arr2);
                else{
                    System.out.print("-");
                    bigNumber_sub(int_arr1,int_arr2);
                }
            }else{
                if(flag==1){
                    System.out.print("-");
                    bigNumber_sub(int_arr2,int_arr1);}else{
                    bigNumber_sub(int_arr2,int_arr1);
                }
            }
        }else {
            b=b.replace("-","");
            a=a.replace("-","");
            int[] int_arr1 = split_Number(a);
            int[] int_arr2 = split_Number(b);
            System.out.println("-");
            bigNumber_add(int_arr1,int_arr2);
        }
    }

    public static void signed_Sub(String a,String b){

        if(!a.contains("-") && !b.contains("-")){
            if(singed_Compare(a,b)==1){
                int[] int_arr1 = split_Number(a);
                int[] int_arr2 = split_Number(b);
                bigNumber_sub(int_arr1,int_arr2);
            }else {
                int[] int_arr1 = split_Number(a);
                int[] int_arr2 = split_Number(b);
                System.out.print("-");
                bigNumber_sub(int_arr2,int_arr1);
            }
        }else if( (!a.contains("-")&&b.contains("-")) || (a.contains("-")&&!b.contains("-")) ){
            int flag = singed_Compare(a,b);
            if(a.contains("-"))a=a.replace("-","");
            else b=b.replace("-","");
            int[] int_arr1 = split_Number(a);
            int[] int_arr2 = split_Number(b);
            if(flag==1) {
                    bigNumber_add(int_arr1,int_arr2);
            }else{
                System.out.print("-");
                bigNumber_add(int_arr1,int_arr2);
            }
        }else {
            b=b.replace("-","");
            a=a.replace("-","");
            int flag = singed_Compare(a,b);
            int[] int_arr1 = split_Number(a);
            int[] int_arr2 = split_Number(b);
            if(flag==1){
                System.out.println("-");
                bigNumber_sub(int_arr1,int_arr2);
            }else{
                bigNumber_sub(int_arr2,int_arr1);
            }
        }
    }

    public static int[] split_Number(String str){
        str = new StringBuffer(str).reverse().toString();
        char[] str_arr = str.toCharArray();
        int count=0;
        int segment = str.length()/8;//java会自动向下取整
        int[] number_Array =new int[segment+1];
        String input_str="";
        for (int i = 0; i < segment; i++) {
            for (int j = 0; j < 8; j++) {
                int index = 8*i+j;
                input_str = input_str.concat(str_arr[index]+"");
            }
            input_str = new StringBuffer(input_str).reverse().toString();
            number_Array[i]=Integer.parseInt(input_str);
            input_str="";

            if(i==(segment-1)){
                input_str="";
                for (int j = 0; j < str.length()-8*(i+1); j++) {
                    int index = 8*(i+1)+j;
                    input_str = input_str.concat(str_arr[index]+"");
                }
                input_str = new StringBuffer(input_str).reverse().toString();
                number_Array[i+1]=Integer.parseInt(input_str);
            }
        }
        return number_Array;
    }
    public static ArrayList input_number(){
        //8位一段
        Scanner sc=new Scanner(System.in);
        String str="";
        ArrayList arr = new ArrayList();
        while (sc.hasNext()){
            str = sc.nextLine();
            arr.add(str);
        }
        return arr;
    }
    public static void bigNumber_add(int[] int_arr1,int[] int_arr2){
        int minSegment = (int_arr1.length>int_arr2.length) ?int_arr2.length:int_arr1.length;
        int maxSegment = (int_arr1.length>int_arr2.length) ?int_arr1.length:int_arr2.length;
        int segmentLength=8;
        int[] resSet = new int[maxSegment];
        int count=0;//count=0表示 没有进位
        for (int i = 0; i < maxSegment; i++) {
            if(i<=minSegment){
                if(count==0){
                    int number_int = (int_arr1[i]+int_arr2[i]); //* ( (int)Math.pow(10,i*8) );
                    //有进位
                    count = (new String(number_int+"")).length() > 8?1:0;
                    if(count==1) resSet[i]=number_int-100000000;
                    else{ resSet[i]=number_int;}
                }else{
                    int number_int =  int_arr1[i]+int_arr2[i]+1;
                    count = (new String(number_int+"")).length() > 8?1:0;
                    if(count==1) resSet[i]=number_int-100000000;
                    else{
                        resSet[i]=number_int;
//                        count=0;
                    }
                }

            }else{
                if(count==1){
                    int number_int = (int_arr1.length>int_arr2.length) ?int_arr1[i]+1 : int_arr2[i]+1;
                    count = (new String(number_int+"")).length() > 8?1:0;
                    if(count==1) resSet[i]=number_int-100000000;
                    else {
                        resSet[i]=number_int;
                    }
                }

            }
        }
        for (int i = resSet.length-1; i >=0; i--) {
            System.out.print(resSet[i]);
        }
        System.out.println();
    }
    public static String sub_Normalization(int number){
        String str="";
        if(number<100000000) str=""+number;
        if(number<10000000) str="0"+number;
        if(number<1000000) str="00"+number;
        if(number<100000) str="000"+number;
        if(number<10000) str="0000"+number;
        if(number<1000) str="00000"+number;
        if(number<100) str="000000"+number;
        if(number<10) str="0000000"+number;
        if(number==0) str="00000000";
        return str;
    }
    public static void bigNumber_sub(int[] int_arr1,int[] int_arr2){
        int minSegment = (int_arr1.length>int_arr2.length) ?int_arr2.length:int_arr1.length;
        int maxSegment = (int_arr1.length>int_arr2.length) ?int_arr1.length:int_arr2.length;
        int segmentLength=8;
        int[] resSet = new int[maxSegment];
        int count=0;//count=0表示 没有借位
        for (int i = 0; i < maxSegment; i++) {
            if(i<=minSegment){
                if(count==0){
                    //第1次计算 不需要借位count==0
                    if( (int_arr1[i]-int_arr2[i]) <0 ){
                        //需要补位
                        resSet[i] = int_arr1[i]-int_arr2[i]+100000000;
                        count=1;
                    }
                    else {
                        //不需要补位
                        int number_int = (int_arr1[i]-int_arr2[i]); //* ( (int)Math.pow(10,i*8) );
                        resSet[i] = number_int;
                    }
                }else{
                    if( (int_arr1[i]-int_arr2[i]-1) <0 ){
                        resSet[i] = int_arr1[i]-int_arr2[i]-1+100000000;
                        count=1;
                    } else {
                        int number_int = (int_arr1[i]-int_arr2[i]-1); //* ( (int)Math.pow(10,i*8) );
                        resSet[i] = number_int;
                        count=0;
                    }
                }

            }else{
                int number_int = (int_arr1.length>int_arr2.length) ?int_arr1[i] : int_arr2[i];
                resSet[i]=number_int;
            }
        }
        for (int i = resSet.length-1; i >=0; i--) {
            if(i==(resSet.length-1)) System.out.print(resSet[i]);
            else {
                System.out.print(sub_Normalization(resSet[i]));
            }
        }
        System.out.println();
    }
    public static void main(String[] args) {
        ArrayList arr = input_number();
        System.out.println();
        signed_Add(arr.get(0).toString(),arr.get(1).toString());
        signed_Sub(arr.get(0).toString(),arr.get(1).toString());

    }
}