Anatolii.Stepaniuk
BAN USERIncrementing each day in a range (initialize it with 0 when first occurs) and then find the max by iterating:
import java.util.*;
public class MaxNumOfTravelers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
Map<Integer, Integer> numberOfTravelers = new HashMap();
for(int n = 0; n < N; n++){
int start = scanner.nextInt();
int finish = scanner.nextInt();
for(int i = start; i <= finish; i++){
numberOfTravelers.putIfAbsent(i,0);
numberOfTravelers.put(i, numberOfTravelers.get(i)+1);
}
}
int maxTravelers = Integer.MIN_VALUE;
int maxDay = -1;
for(Map.Entry<Integer, Integer> entry : numberOfTravelers.entrySet()){
if(entry.getValue() > maxTravelers){
maxTravelers = entry.getValue();
maxDay = entry.getKey();
}
}
System.out.println("Max day - " + maxDay);
}
}
import java.util.*;
public class HotelReviews {
public static void main(String[] args) {
List<String> query = new ArrayList(Arrays.asList("good", "shit"));
TreeSet<Rating> chart = new TreeSet();
Map<Integer, List<String>> reviews = new HashMap();
reviews.put(1, new ArrayList(Arrays.asList("good", "great", "awesome", "good")));
reviews.put(2, new ArrayList(Arrays.asList("nasty", "shit", "disgusting")));
reviews.put(3, new ArrayList(Arrays.asList("moderate", "good", "shit")));
for(Map.Entry<Integer, List<String>> entry : reviews.entrySet()){
List<String> description = new ArrayList(entry.getValue());
description.retainAll(query);
chart.add(new Rating(entry.getKey(), description.size()));
}
for(Rating rating : chart){
System.out.println("hotel: " + rating.hotelId + ", rating: " + rating.rating);
}
}
static class Rating implements Comparable{
int hotelId;
int rating;
public Rating(int hotelId, int rating){
this.hotelId = hotelId;
this.rating = rating;
}
public int compareTo(Object other){
Rating otherRating = (Rating) other;
return 2 * Integer.compare(otherRating.rating, this.rating) + Integer.compare(this.hotelId, otherRating.hotelId);
}
}
}
- Anatolii.Stepaniuk June 28, 2017
How about this? Nice and slim!
- Anatolii.Stepaniuk June 28, 2017