注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
刚刚做的OA, practice是 UniqueMeal, OA题是Reachable Business。然后附上俺之前整理的OA全集 。 UniqueMeal是全pass,但是 OA有2个testcase没有过。 很伤吧,估计没了。 但是还是求米, 因为吃了积分限制的亏,每次都得麻烦别人或者淘宝买帖子,所以我就不放任何限制了,看在楼主不放任何积分限制的情况下,求一些大米儿。给米不扣自己的大米。给米不扣自己的大米。给米不扣自己的大米。给米不扣自己的大米。给米不扣自己的大米。给米不扣自己的大米给米不扣自己的大米给米不扣自己的大米给米不扣自己的大米。
最后祝福大家求职顺利 一切都是最好的安排。
1.Active Business
public class ActiveBusiness {
public List<Event> events;
public int eventTypeAmount;
public ActiveBusiness(){
events = new ArrayList<>();
eventTypeAmount = 4;
events.add(new Event("ads", 7, 3));
events.add(new Event("ads", 8, 2));
events.add(new Event("ads", 5, 1));
events.add(new Event("page_views", 11, 2));
events.add(new Event("page_views", 12, 3));
events.add(new Event("photo_views", 10, 3));
events.add(new Event("reviews", 7, 2));
}
private class Event{
String type;
int times;
int biz_id;
public Event(String type, int times, int biz_id) {
this.type = type;
this.times = times;
this.biz_id = biz_id;
}
}
public List<Integer> findActiveBusiness(List<Event> events){
List<Integer> res = new ArrayList<>();
Map<Integer, Integer[]> bizs = new HashMap<>();
int[] sum = new int[eventTypeAmount];
int[] count = new int[eventTypeAmount];
for(int i = 0; i < events.size(); ++i){
if(events.get(i).type.equals("photo_views")){
sum[0] += events.get(i).times;
count[0]++;
if(!bizs.containsKey(events.get(i).biz_id)){
Integer[] temp = {0,0,0,0};
temp[0] = events.get(i).times;
bizs.put(events.get(i).biz_id, temp);
} else {
Integer[] temp = bizs.get(events.get(i).biz_id);
temp[0] = events.get(i).times;
bizs.put(events.get(i).biz_id, temp);
}
} else if (events.get(i).type.equals("ads")) {
sum[1] += events.get(i).times;
count[1]++;
if (!bizs.containsKey(events.get(i).biz_id)) {
Integer[] temp = {0, 0, 0, 0};
temp[1] = events.get(i).times;
bizs.put(events.get(i).biz_id, temp);
} else {
Integer[] temp = bizs.get(events.get(i).biz_id);
temp[1] = events.get(i).times;
bizs.put(events.get(i).biz_id, temp);
}
} else if (events.get(i).type.equals("page_views")) {
sum[2] += events.get(i).times;
count[2]++;
if (!bizs.containsKey(events.get(i).biz_id)) {
Integer[] temp = {0, 0, 0, 0};
temp[2] = events.get(i).times;
bizs.put(events.get(i).biz_id, temp);
} else {
Integer[] temp = bizs.get(events.get(i).biz_id);
temp[2] = events.get(i).times;
bizs.put(events.get(i).biz_id, temp);
}
} else if (events.get(i).type.equals("reviews")) {
sum[3] += events.get(i).times;
count[3]++;
if (!bizs.containsKey(events.get(i).biz_id)) {
Integer[] temp = {0, 0, 0, 0};
temp[3] = events.get(i).times;
bizs.put(events.get(i).biz_id, temp);
} else {
Integer[] temp = bizs.get(events.get(i).biz_id);
temp[3] = events.get(i).times;
bizs.put(events.get(i).biz_id, temp);
}
}
}
double[] avg = new double[4];
for(int i = 0; i < sum.length; ++i){
if(count[i] != 0){
avg[i] = sum[i]/count[i];
}
}
for(int i : bizs.keySet()){
Integer[] t = bizs.get(i);
i rate;
int query_time = query[1] - query[0];
int right_time = 0;
for(Integer[] open : openHours){
if(open[0] <= query[0] && open[1] >= query[1]){//the query time include in open hours
//this means that whole query time is suitable.
right_time += query_time;
} else if(open[0] >= query[0] && open[1] <= query[1]){//the open hours include in query time
right_time += open[1]-open[0];
} else {
if(open[0] <= query[0] && open[1] <= query[1] && open[1] >= query[0]){
right_time += open[1] - query[0];
}
if(query[0] <= open[0] && query[1] <= open[1] && open[1] >= query[1]){
right_time += query[1] - open[0];
}
}
}
rate = Float.intBitsToFloat(right_time)/Float.intBitsToFloat(query_time);
return rate;
}
}
8.Find topic occurrences in reviews
public class TopicOccurrences {
private static Map<String, Integer> countTopicOccurrence(Map<String, List<String>> toptics, List<String> reviews){
if(reviews == null || reviews.size() == 0) return new HashMap();
Map<String, Integer> resultMap = new HashMap<>();
List<String> processReviews = preProcessReviews(reviews);
for(int index = 0; index < processReviews.size(); index++){
for(Map.Entry<String, List<String>> toptic : toptics.entrySet()){
if(!resultMap.containsKey(toptic.getKey())){
resultMap.put(toptic.getKey(), 0);
}
for(int i = 0; i < toptic.getValue().size(); i++){
String word = toptic.getValue().get(i);
String review = processReviews.get(index);
if(review.contains(word)){
resultMap.put(toptic.getKey(), resultMap.getOrDefault(toptic.getKey(), 0)+1);
break;
}
}
}
}
return resultMap;
}
private static List<String> preProcessReviews(List<String> reviews){
List<String> result = new ArrayList<>();
for(String str : reviews){
StringBuilder sb = new StringBuilder();
String[] strArray = str.split(" ");
for(int i = 0; i < strArray.length; i++){
sb.append(strArray[i].toLowerCase().trim()).append(" ");
}
System.out.println(sb.toString().trim());
result.add(sb.toString().trim());
}
return result;
}
}
|