-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTest2004_2.java
More file actions
69 lines (62 loc) · 1.83 KB
/
Test2004_2.java
File metadata and controls
69 lines (62 loc) · 1.83 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
package org.line;
public class Test2004_2 {
/*
* 정답 1 2 3 4 5 1 2 3 4 5
* 사람1 5 5 1 2 5 1 3 4 5 5
* 사람2 5 5 1 3 1 2 3 4 5 5
* 사람3 5 5 1 3 1 2 3 4 5 4
* 오답이 같은 사람의 커닝수구하기
*
* */
public static void main(String[] args) {
String[] ss = {"24553", "24553", "24553", "24553"};
String a = "14553";
solution(a, ss);
String[] ss2 = {"5512513455", "5513123455", "5513123454"};
String a2 = "1234512345";
//solution(a2, ss2);
}
public static int solution(String answer_sheet, String[] sheets) {
int answer = 0;
String[] newSheets = new String[sheets.length];
for (int i = 0; i < sheets.length; i++) {
StringBuilder sb = new StringBuilder();
String sheet = sheets[i];
for(int j=0; j<answer_sheet.length(); j++) {
if(answer_sheet.charAt(j) != sheet.charAt(j)) {
sb.append(sheet.charAt(j));
}
else
sb.append(0);
}
newSheets[i] = new String(sb);
}
for (int i = 0; i < newSheets.length-1; i++) {
String str1 = newSheets[i];
for(int j=i+1; j<newSheets.length; j++) {
String str2 = newSheets[j];
int cnt = 0;
int length = 0;
int maxLength = 0;
for(int k=0; k<str1.length();k++) {
if(str1.charAt(k) == '0' || str1.charAt(k) != str2.charAt(k)) {
maxLength = Math.max(length, maxLength);
length = 0;
continue;
}
if(str1.charAt(k) == str2.charAt(k)) {
System.out.print(str1.charAt(k)+" ");
cnt++;
length++;
}
}
maxLength = Math.max(length, maxLength);
answer = Math.max(answer , cnt + (maxLength * maxLength));
System.out.println();
System.out.println("str1="+str1+" str2="+str2+" cnt="+cnt+" maxLength="+maxLength);
}
}
System.out.println(answer);
return answer;
}
}