Skip to content

[mukeunzi] 190527 모의고사 알고리즘 문제풀이 #50

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
honux77 merged 1 commit into from
Jun 3, 2019
Merged

[mukeunzi] 190527 모의고사 알고리즘 문제풀이 #50

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
46 changes: 46 additions & 0 deletions 190527/mukeunzi/MockTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,46 @@
import java.util.*;

class Solution {
public int[] solution(int[] answers) {
int way1[] = new int[]{1, 2, 3, 4, 5};
int way2[] = new int[]{2, 1, 2, 3, 2, 4, 2, 5};
int way3[] = new int[]{3, 3, 1, 1, 2, 2, 4, 4, 5, 5};
int cnt[] = new int[3];
int max = 0;
int result[];
List<Integer> answer = new ArrayList<>();

for(int i=0; i<answers.length; i++){
if(way1[i%way1.length] == answers[i]){
cnt[0]++;
}
if(way2[i%way2.length] == answers[i]){
cnt[1]++;
}
if(way3[i%way3.length] == answers[i]){
cnt[2]++;
}
}

max = cnt[0];
if(max < cnt[1]){
max = cnt[1];
}
if(max < cnt[2]){
max = cnt[2];
}

for(int i=0; i<cnt.length; i++){
if(max == cnt[i]){
answer.add(i+1);
}
}

result = new int[answer.size()];
for(int i=0; i<answer.size(); i++){
result[i] = answer.get(i);
}

return result;
}
}