[0614] Programmers_ko

0614/Programmers/Lv1/두개뽑아서더하기_ko.java

@@ -1 +1,18 @@
+class Solution {
+	public int[] solution(int[] numbers) {
+		int len = numbers.length;
+		int cnt = 0;
+		int[] sum = new int[201];
+		for (int i = 0; i < len - 1; i++)
+			for (int j = i + 1; j < len; j++)
+				if (sum[numbers[i] + numbers[j]]++ == 0)
+					cnt++; // 중복 없는 개수 세기
+
+		int[] answer = new int[cnt];
+		for (int i = 200; i > 0 && cnt >= 0; i--)
+			if (sum[i] > 0)
+				answer[--cnt] = i;
 
+		return answer;
+	}
+}

0614/Programmers/Lv2/단체사진찍기_ko.java

@@ -1 +1,68 @@
+import java.util.HashMap;
 
+class Solution {
+	static int answer;
+	static int[] place;
+	static HashMap<Character, Integer> map;
+	static int len;
+
+	public int solution(int n, String[] data) {
+		answer = 0;
+		len = n;
+		place = new int[8];
+		map = new HashMap<>(); // 카카오프렌즈 place 인덱스
+
+		map.put('A', 0);
+		map.put('C', 1);
+		map.put('F', 2);
+		map.put('J', 3);
+		map.put('M', 4);
+		map.put('N', 5);
+		map.put('R', 6);
+		map.put('T', 7);
+
+		nPn(data, 0, 0);
+
+		return answer;
+	}
+
+	static void nPn(String[] data, int idx, int visit) { // 8명 순열
+		if (idx == 8) {
+			if (check(data))
+				answer++;
+			return;
+		}
+
+		for (int i = 0; i < 8; i++)
+			if ((visit & (1 << i)) == 0) { // 이 위치 안 썼으면
+				place[idx] = i; // idx는 카카오프렌즈, i는 이번 위치
+				nPn(data, idx + 1, visit | (1 << i));
+			}
+	}
+
+	static boolean check(String[] data) {
+		int abDiff, diff;
+		for (int i = 0; i < len; i++) {
+			abDiff = Math.abs(place[map.get(data[i].charAt(0))] - place[map.get(data[i].charAt(2))]);
+			diff = data[i].charAt(4) - '0' + 1;
+
+			switch (data[i].charAt(3)) {
+			case '=':
+				if (abDiff != diff)
+					return false;
+				break;
+			case '>':
+				if (abDiff <= diff)
+					return false;
+				break;
+			default:
+				if (abDiff >= diff)
+					return false;
+				break;
+			}
+
+		}
+		return true;
+	}
+
+}