アルゴリズム:Rev(X)関数は反転する数字のために2つの数を入力して彼らのresult=Rev(Rev(num 1)+Rev(num 2))を求めます

package test;

import java.util.Scanner;

/**
 *    Rev(X)                   result=Rev(Rev(num1)+Rev(num2))       0，  
 */
public class Test2{

    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        String str1 = scanner.nextLine();
        String str2 = scanner.nextLine();
        int str3;
        String result;
        str3=Rev(str1)+Rev(str2);
        result=String.valueOf(str3);
        str3 = Rev(result);
        System.out.println(str3);


    }
    static int Rev(String str){
        char temp=0;
        String newStr="";
        char chars[] = str.toCharArray();
        for(int i=0;i2;i++){
            temp=chars[i];
            chars[i] = chars[chars.length-i-1];
            chars[chars.length-i-1] = temp;
        }
        for(int i=0;iif(chars[i]=='0' && (i==0 || i==chars.length-1)){
                continue;
            }else {
                newStr += chars[i];
            }
        }
        return Integer.parseInt(newStr);
    }

}