Merge pull request #14 from printSANO/Ryan_Study

[211123]Programmers 2주&3주차

Author: EunjiShin

RyanLee/Programmers/finish.java

@@ -0,0 +1,18 @@
+package Programmers;
+import java.util.HashMap;
+
+public class finish{
+    public String solution(String[] participant, String[] completion) {   
+    String answer = "";
+    HashMap<String, Integer> hm = new HashMap<>();
+    for(String player : participant) hm.put(player , hm.getOrDefault(player,0)+1);
+    for(String player : completion) hm.put(player , hm.get(player)-1);
+
+    for(String key : hm.keySet()){
+        if (hm.get(key) !=0){
+            answer = key;
+        }
+    }
+    return answer;
+    }
+}

RyanLee/Programmers/모의고사.java

@@ -0,0 +1,32 @@
+package Programmers;
+
+public class 모의고사 {
+    public static int[] solution(int[] answers) {
+        int[] answer;
+        
+        int[] a = new int[]{1,2,3,4,5};
+        int[] b = new int[]{2,1,2,3,2,4,2,5};
+        int[] c = new int[]{3,3,1,1,2,2,4,4,5,5};
+        
+        int[] score = new int[3];
+        for(int i=0; i<answers.length; i++){
+            if(answers[i] == a[i%a.length]) score[0]++; 
+            if(answers[i] == b[i%b.length]) score[1]++;
+            if(answers[i] == c[i%c.length]) score[2]++;
+        }
+        int max = 0;
+        for(int i=0; i<3; i++){
+            if(score[i] > max){ max = score[i]; }
+        }
+        int maxCount = 0;
+        for(int i=0; i<3; i++){
+            if(score[i] == max){ maxCount++; } 
+        }
+        answer = new int[maxCount];
+        int idx = 0;
+        for(int i=0; i<3; i++){
+            if(score[i] == max) answer[idx++] = i+1;
+        }
+        return answer;
+    }
+}