[SW Expert Academy] 일요일 (D3) 자바

https://swexpertacademy.com/main/solvingProblem/solvingProblem.do

SW Expert Academy

 

HashMap을 사용한 풀이

import java.util.HashMap;
import java.util.Scanner;

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

		int t = sc.nextInt();

		HashMap<String, Integer> map = new HashMap<>();

		map.put("MON", 0);
		map.put("TUE", 1);
		map.put("WED", 2);
		map.put("THU", 3);
		map.put("FRI", 4);
		map.put("SAT", 5);
		map.put("SUN", 6);

		for (int tc = 1; tc <= t; tc++) {

			String str = sc.next();

			if (str.equals("SUN"))
				System.out.println("#" + tc + " " + 7);
			else {
				System.out.println("#" + tc + " " + (6 - map.get(str)));
			}

		}

	}
}

 

 

배열과 days.length를 활용한 풀이

import java.util.HashMap;
import java.util.Scanner;

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

		int t = sc.nextInt();

		String days[] = { "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };

		for (int tc = 1; tc <= t; tc++) {

			String day = sc.next();

			int result = 0;

			for (int i = 0; i < days.length; i++) {
				if (days[i].equals(day)) {
					result = days.length - i - 1;
				}
			}

			System.out.println("#" + tc + " " + (result == 0 ? 7 : result));

		}

	}
}