[SW Expert Academy] 안경이 없어! (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWl0ZQ8qn7UDFAXz&categoryId=AWl0ZQ8qn7UDFAXz&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=12

SW Expert Academy

 

내가 푼 풀이

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		int alphaC[] = { 1, 2, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0 };

		for (int tc = 1; tc <= t; tc++) {
			String word1 = sc.next();

			String word2 = sc.next();

			boolean isPossible = true;

			if (word1.length() != word2.length()) {
				isPossible = false;
			}

			else {
				for (int i = 0; i < word1.length(); i++) {
					if (word1.charAt(i) == 'B') {
						if (word2.charAt(i) != 'B') {
							isPossible = false;
							break;

						}
					} else {
						if (alphaC[word1.charAt(i) - 'A'] != alphaC[word2.charAt(i) - 'A']) {
							isPossible = false;
							break;
						}
					}
				}
			}

			if (isPossible) {
				System.out.println("#" + tc + " " + "SAME");
			} else {
				System.out.println("#" + tc + " " + "DIFF");
			}

		}
	}
}

 

좋았던 풀이 (참고)

import java.util.Scanner;
class Solution
{
	public static void main(String args[]) throws Exception {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
        String noHole = "CEFGHIJKLMNSTUVWXYZ";
        String oneHole = "ADOPQR";
		for(int tc= 1; tc <= T; tc++)
		{
	        String a = sc.next();
            String b = sc.next();
            String result = "SAME";
            if(a.length() != b.length()){
                result = "DIFF";
            }else{
                for(int i = 0; i < a.length(); i++){
                    String posA = String.valueOf(a.charAt(i));
                    String posB = String.valueOf(b.charAt(i));
                    if(posA.equals("B") && posB.equals("B")){
                   }else if(noHole.contains(posA) && noHole.contains(posB)){
                   }else if(oneHole.contains(posA) && oneHole.contains(posB)){
                   }else{
                       	result = "DIFF";
                       	break;
                    }
               }
           }
            System.out.println("#" + tc + " " + result);
        }
	}
}

 

정석같은 풀이

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {
			
			String word1 = sc.next();
			String word2 = sc.next();
			
			word1=word1.replaceAll("[CEFGHIJKLMNSTUVWXYZ]", "C").replaceAll("[ADOPQR]", "A");
			word2=word2.replaceAll("[CEFGHIJKLMNSTUVWXYZ]", "C").replaceAll("[ADOPQR]", "A");
			
			System.out.println("#"+tc+" "+(word1.equals(word2)?"SAME":"DIFF"));
		}
	}
}