-
Notifications
You must be signed in to change notification settings - Fork 11
/
TravelBuddy
151 lines (130 loc) · 3.76 KB
/
TravelBuddy
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
import java.util.*;
public List<Buddy> buddies;
public Set<String> myWishList;
public CommonCities(Set<String> myWishList,Map<String,Set<String>> friendWishList) {
this.buddies = new ArrayList<>();
this.myWishList = myWishList;
for(String buddyName : friendWishList.keySet()) {
Set<String> wishList= friendWishList.get(buddyName);
Set<String> intersection = new HashSet<String>(wishList);
intersection.retainAll(myWishList);
int simliarity = intersection.size();
if(simliarity >= myWishList.size()/2) {
buddies.add(new Buddy(buddyName,simliarity,wishList));
}
}
}
public List<String> recommendCities(int k){
List<String> res = new ArrayList<>();
List<Buddy> candidiates = buddies;
candidiates.sort((a,b)->b.similairty-a.similairty);
int i = 0 ;
while(k>0&&i<candidiates.size()) {
Set<String> diff = new HashSet<>(candidiates.get(i).wishList);
diff.removeAll(myWishList);
if(diff.size()<=k) {
res.addAll(diff);
k-=diff.size();
i++;
}
else {
Iterator<String> it = diff.iterator();
while(k>0) {
res.add(it.next());
k--;
}
}
}
return res;
}
class Buddy implements Comparable<Buddy> {
Set<String> wishList;
String name;
int similairty;
public Buddy(String n,int similarity, Set<String> wishList) {
this.name = n;
this.similairty = similarity;
this.wishList = wishList;
}
@Override
public int compareTo(Buddy o) {
// TODO Auto-generated method stub
return o.similairty-this.similairty;
}
}
public class TravelBuddy{
Set<Integer> myCityList;
List<Buddy> buddyList;
class Buddy implements Comparable<Buddy>{
Set<Integer> cityList;
Double similarity;
Set<Integer> recommandList=new HashSet<>();
public Buddy(int[] list) {
this.cityList = list2set(list);
int same = 0;
for(int city:cityList) {
if(myCityList.contains(city)) {
same++;
}
else {
recommandList.add(city);
}
}
this.similarity= same/(double) myCityList.size();
}
@Override
public int compareTo(Buddy o) {
// TODO Auto-generated method stub
return Double.compare(this.similarity, o.similarity);
}
}
public static HashSet<Integer> list2set(int[] wishlist) {
HashSet<Integer> set = new HashSet<>();
for (int city : wishlist) set.add(city);
return set;
}
public TravelBuddy(int[] myCityList, int[][] buddies) {
this.myCityList = list2set(myCityList);
this.buddyList = new ArrayList<>();
for(int[] candidate:buddies) {
Buddy candiBuddy = new Buddy(candidate);
if(candiBuddy.similarity>0.5) {
this.buddyList.add(candiBuddy);
}
}
//Collections.sort(this.buddyList,(a,b)->(int)(10*b.similarity-10*a.similarity));
}
public List<Integer> recommend(int k){
List<Integer> recommandList = new ArrayList<>();
HashSet<Integer> used = new HashSet<>();
int count =0;
for(Buddy buddy:this.buddyList) {
for(int city:buddy.recommandList) {
if(k==count) return recommandList;
if(!used.contains(city)) {
used.add(city);
recommandList.add(city);
count++;
}
}
}
return recommandList;
}
public static void main(String[] args) {
TravelBuddy solution = new TravelBuddy(new int[]{1, 2, 3, 4, 5},
new int[][]{
new int[]{3, 4, 6, 8, 10}, // 2
new int[]{1, 2, 4, 5, 8}, // 4
new int[]{1, 3, 6, 7, 9}, // 2
new int[]{1, 2, 4, 7, 11}, // 3
new int[]{1,2,3,5, 6, 7, 12, 13} // 4
});
List<Integer> r1 = solution.recommend(10);
List<Integer> r2 = solution.recommend(5);
List<Integer> r3 = solution.recommend(2);
System.out.println(r1);
System.out.println(r2);
System.out.println(r3);
return;
}
}