Vigenère password (P1079 Los problem solution to a problem Valley, Java language description)

Questions asked

P1079 topic Link

analysis

This problem is not very good to speak, done for some time.
However, the introduction of a bunch of formulas very troublesome.
We are interested in your own look.

We recommend two extreme approaches:

• ASCII code ultra compact solution
• Tragic play table approach

AC Code (Java description language)

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] chars1 = scanner.nextLine().trim().toCharArray();
        char[] chars2 = scanner.nextLine().trim().toCharArray();
        scanner.close();
        for (int i = 0; i < chars2.length; i++) {
            int temp = chars2[i] - chars1[i%chars1.length] + 26;
            boolean isUpper = Character.isUpperCase(chars1[i%chars1.length]);
            if (Character.isUpperCase(chars2[i])) {
                if (isUpper) {
                    chars2[i] = (char)((temp % 26) + 'A');
                } else {
                    chars2[i] = (char)(((temp - 'A' + 'a') % 26) + 'A');
                }
            } else {
                if (isUpper) {
                    chars2[i] = (char)(((temp - 'a' + 'A') % 26) + 'a');
                } else {
                    chars2[i] = (char)((temp % 26) + 'a');
                }
            }
        }
        System.out.println(new String(chars2));
    }
}