PAT 乙级 1048. 数字加密(20) Java版

本题要求实现一种数字加密方法。首先固定一个加密用正整数A，对任一正整数B，将其每1位数字与A的对应位置上的数字进行以下运算：对奇数位，对应位的数字相加后对13取余——这里用J代表10、Q代表11、K代表12；对偶数位，用B的数字减去A的数字，若结果为负数，则再加10。这里令个位为第1位。

输入格式：

输入在一行中依次给出A和B，均为不超过100位的正整数，其间以空格分隔。

输出格式：

在一行中输出加密后的结果。

输入样例：

1234567 368782971

1	1234567 368782971

输出样例：

3695Q8118

3695Q8118

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

public class Main {

	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);
		String a = in.next();
		String b = in.next();
		in.close();

		int i = a.length() - 1;
		int j = b.length() - 1;

		if (i > j) {
			int c = i - j;
			while (c != 0) {
				b = "0" + b;
				c--;
			}
		} else if (i < j) {
			int c = j - i;
			while (c != 0) {
				a = "0" + a;
				c--;
			}
		}
		
		int index = b.length() - 1; // index = a.length() - 1
		boolean isOdd = true;
		Stack<String> stack = new Stack<>();
		while (index >= 0) {
			if (isOdd) {
				isOdd = false;
				int cNumber = a.charAt(index) - '0' + b.charAt(index) - '0';
				String r = null;
				switch (cNumber) {
				case 10:
					r = "J";
					break;
				case 11:
					r = "Q";
					break;
				case 12:
					r = "K";
					break;
				default:
					r = "" + cNumber % 13;
					break;
				}
				
				stack.push(r);
			} else {
				isOdd = true;
				int cNumber = (b.charAt(index)  - a.charAt(index) + 10) % 10;
				String r = "" + cNumber;
				
				stack.push(r);
			}
			
			index--;
		}
		
		while (!stack.isEmpty()) {
			System.out.print(stack.pop());
		}
 	}

}

import java.util.Scanner;

import java.util.Stack;

public class Main {

public static void main(String[] args) {

Scanner in = new Scanner(System.in);

String a = in.next();

String b = in.next();

in.close();

int i = a.length() - 1;

int j = b.length() - 1;

if (i > j) {

int c = i - j;

while (c != 0) {

b = "0" + b;

c--;

}

} else if (i < j) {

int c = j - i;

while (c != 0) {

a = "0" + a;

c--;

}

int index = b.length() - 1; // index = a.length() - 1

boolean isOdd = true;

Stack<String> stack = new Stack<>();

while (index >= 0) {

if (isOdd) {

isOdd = false;

int cNumber = a.charAt(index) - '0' + b.charAt(index) - '0';

String r = null;

switch (cNumber) {

case 10:

r = "J";

break;

case 11:

r = "Q";

break;

case 12:

r = "K";

break;

default:

r = "" + cNumber % 13;

break;

}

stack.push(r);

} else {

isOdd = true;

int cNumber = (b.charAt(index) - a.charAt(index) + 10) % 10;

String r = "" + cNumber;

stack.push(r);

}

index--;

}

while (!stack.isEmpty()) {

System.out.print(stack.pop());

}

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版