|
| 1 | +packagecom.fishercoder.solutions; |
| 2 | + |
| 3 | +importjava.util.ArrayList; |
| 4 | +importjava.util.HashMap; |
| 5 | +importjava.util.HashSet; |
| 6 | +importjava.util.List; |
| 7 | +importjava.util.Map; |
| 8 | +importjava.util.Set; |
| 9 | +importjava.util.TreeMap; |
| 10 | + |
| 11 | +publicclass_1152 { |
| 12 | +publicstaticclassSolution1 { |
| 13 | +publicList<String>mostVisitedPattern(String[]username,int[]timestamp,String[]website) { |
| 14 | +Map<String,TreeMap<Integer,String>>userToSiteMap =newHashMap<>(); |
| 15 | +for (inti =0;i <username.length;i++) { |
| 16 | +if (!userToSiteMap.containsKey(username[i])) { |
| 17 | +userToSiteMap.put(username[i],newTreeMap<>()); |
| 18 | + } |
| 19 | +TreeMap<Integer,String>timeToSiteMap =userToSiteMap.get(username[i]); |
| 20 | +timeToSiteMap.put(timestamp[i],website[i]); |
| 21 | +userToSiteMap.put(username[i],timeToSiteMap); |
| 22 | + } |
| 23 | +Map<String,Integer>sequenceCountMap =newHashMap<>(); |
| 24 | +for (Stringuser :userToSiteMap.keySet()) { |
| 25 | +TreeMap<Integer,String>timeToSiteMap =userToSiteMap.get(user); |
| 26 | +if (timeToSiteMap.size() <3) { |
| 27 | +continue; |
| 28 | + }else { |
| 29 | +List<Integer>times =newArrayList<>(); |
| 30 | +for (inttime :timeToSiteMap.keySet()) { |
| 31 | +times.add(time); |
| 32 | + } |
| 33 | +List<String>allSequences =formAllSequences(times,timeToSiteMap); |
| 34 | +Set<String>encounteredSequence =newHashSet<>(); |
| 35 | +for (Stringsequence :allSequences) { |
| 36 | +if (encounteredSequence.add(sequence)) { |
| 37 | +sequenceCountMap.put(sequence,sequenceCountMap.getOrDefault(sequence,0) +1); |
| 38 | + } |
| 39 | + } |
| 40 | + } |
| 41 | + } |
| 42 | +List<String>mostVisitedPattern =newArrayList<>(); |
| 43 | +intcount =0; |
| 44 | +Stringresult =null; |
| 45 | +for (Stringsequence :sequenceCountMap.keySet()) { |
| 46 | +if (sequenceCountMap.get(sequence) >count) { |
| 47 | +result =sequence; |
| 48 | +count =sequenceCountMap.get(sequence); |
| 49 | + }elseif (count ==sequenceCountMap.get(sequence)) { |
| 50 | +if (sequence.compareTo(result) <0) { |
| 51 | +result =sequence; |
| 52 | + } |
| 53 | + } |
| 54 | + } |
| 55 | +for (Stringsite :result.split("->")) { |
| 56 | +mostVisitedPattern.add(site); |
| 57 | + } |
| 58 | +returnmostVisitedPattern; |
| 59 | + } |
| 60 | + |
| 61 | +privateList<String>formAllSequences(List<Integer>times,TreeMap<Integer,String>timeToSiteMap) { |
| 62 | +List<String>result =newArrayList<>(); |
| 63 | +for (inti =0;i <times.size() -2;i++) { |
| 64 | +for (intj =i +1;j <times.size() -1;j++) { |
| 65 | +for (intk =j +1;k <times.size();k++) { |
| 66 | +result.add(timeToSiteMap.get(times.get(i)) +"->" +timeToSiteMap.get(times.get(j)) +"->" +timeToSiteMap.get(times.get(k))); |
| 67 | + } |
| 68 | + } |
| 69 | + } |
| 70 | +returnresult; |
| 71 | + } |
| 72 | + } |
| 73 | +} |