forked from c4fiber/java-onboarding
-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathProblem7.java
More file actions
100 lines (82 loc) · 3.1 KB
/
Problem7.java
File metadata and controls
100 lines (82 loc) · 3.1 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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
package onboarding;
import java.util.*;
public class Problem7 {
public static List<String> solution(String user, List<List<String>> friends, List<String> visitors) {
Map<String, Integer> map = new TreeMap<>();
// user의 친구리스트 생성
List<String> list = new ArrayList<>();
for(int i = 0; i< friends.size(); i++){
List<String> target = friends.get(i);
String target1 = target.get(0);
String target2 = target.get(1);
if (target1.equals(user)){
list.add(target2);
} else if (target2.equals(user)){
list.add(target1);
}
}
// 친구의 친구 조회후 값 추가
for(int j = 0; j<list.size(); j++){
for (int jj = 0; jj<friends.size(); jj++) {
List<String> target = friends.get(jj);
String target1 = target.get(0);
String target2 = target.get(1);
if (list.get(j).equals(target1)) {
if (map.containsKey(target2)) {
int tmpV = map.get(target2);
tmpV += 10;
map.put(target2, tmpV);
} else {
map.put(target2, 10);
}
} else if (list.get(j).equals(target2)) {
if (map.containsKey(target1)) {
int tmpV = map.get(target1);
tmpV += 10;
map.put(target1, tmpV);
} else {
map.put(target1, 10);
}
}
}
}
for(int v = 0; v<visitors.size(); v++){
String target = visitors.get(v);
if (map.containsKey(target)){
int tmpV = map.get(target);
tmpV+=1;
map.put(target, tmpV);
} else{
map.put(target, 1);
}
}
// user가 속하면 삭제
if(map.containsKey(user)){
map.remove(user);
}
// 친구가 속하면 삭제
for(int i = 0; i<list.size(); i++){
String targetF = list.get(i);
System.out.println("targetF"+ targetF);
if(map.containsKey(targetF)){
map.remove(targetF);
}
}
// map을 value값으로 정렬하기
List<Map.Entry<String, Integer>> entryList = new ArrayList<>(map.entrySet());
entryList.sort((entry1, entry2) -> {
int valueComparison = entry2.getValue().compareTo(entry1.getValue());
if (valueComparison == 0){
return entry1.getKey().compareTo(entry2.getKey());
} else{
return valueComparison;
}
});
Map<String, Integer> sortedMap = new LinkedHashMap<>();
for (Map.Entry<String, Integer> entry : entryList) {
sortedMap.put(entry.getKey(), entry.getValue());
}
List<String> answer = new ArrayList<>(sortedMap.keySet());
return answer;
}
}