[알고리즘/백준] #1076 저항

난이도: Bronze2
문제)

• Map을 이용

package sw_study.bj1076;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;

public class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		//맵 생성 후 값 넣어주기
		Map<String, String> map = new HashMap<String, String>();
		
		map.put("black", "0");
		map.put("brown", "1");
		map.put("red", "2");
		map.put("orange", "3");
		map.put("yellow", "4");
		map.put("green", "5");
		map.put("blue", "6");
		map.put("violet", "7");
		map.put("grey", "8");
		map.put("white", "9");
		
		String s1=br.readLine();
		if(!s1.equals("black")) sb.append(map.get(s1));
		String s2=br.readLine();
		String s3=br.readLine();
		
		sb.append(map.get(s2));
		for(int i=0;i<Integer.parseInt(map.get(s3));i++) {
			sb.append("0");
		}
		if(s1.equals("black")&&s2.equals("black")) {
			sb.setLength(0);
			sb.append("0");
		}
		
		System.out.print(sb.toString());
	}
}

• 배열을 이용

package sw_study.bj1076;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main2 {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		
		String[] s= {"black","brown","red","orange","yellow","green","blue","violet","grey","white"};
		
		String s1 =br.readLine();
		
		if(!s1.equals("black")) sb.append(Arrays.asList(s).indexOf(s1));
		String s2 =br.readLine();
		String s3 =br.readLine();
		sb.append(Arrays.asList(s).indexOf(s2));
		
		for(int i=0;i<Arrays.asList(s).indexOf(s3);i++) {
			sb.append("0");
		}
		if(s1.equals("black")&&s2.equals("black")) {
			sb.setLength(0);
			sb.append("0");
		}
		System.out.print(sb.toString());
	}
}