내용

글번호 613
작성자 heojk
작성일 2017-03-17 15:32:05
제목 [코딩 테스트] - The Love-Letter Mystery - Solution
내용 import java.util.Scanner; public class TheLoveLetterMystery { public static void main(String[] args) { //This is stub code. Scanner stdin = new Scanner(System.in); int tests = stdin.nextInt(); String[] letters = new String[tests]; for(int i = 0; i < letters.length; i++) { letters[i] = stdin.next(); } stdin.close(); int[] result = mystery(letters); for(int count : result) { System.out.println(count); } } static int[] mystery(String[] letters) { int[] result = new int[letters.length]; for(int i = 0; i < letters.length; i++) { int diff = 0; for(int j = 0; j < letters[i].length() / 2; j++) { // System.out.println((int)letters[i].charAt(j)); // System.out.println(Character.codePointAt(letters[i], j)); diff += Math.abs(Character.codePointAt(letters[i], j) - Character.codePointAt(letters[i], letters[i].length() - j - 1)); } result[i] = diff; } return result; } }