add 1152

fishercoder1534 · fishercoder1534 · commit 42c343459f20 · 2020-11-26T10:19:06.000-08:00
diff --git a/README.md b/README.md
@@ -225,6 +225,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1161|[Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1161.java) | |Medium|Graph|
 |1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java)| |Easy||
 |1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | |Easy||
+|1152|[Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1152.java) | |Medium|HashTable, Sort, Array|
 |1150|[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1150.java)|[:tv:](https://youtu.be/-t2cdVs9cKk) |Easy||
 |1146|[Snapshot Array](https://leetcode.com/problems/snapshot-array/)|[Javascript](./javascript/_1146.js)| | Easy ||
 |1138|[Alphabet Board Path](https://leetcode.com/problems/alphabet-board-path/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1138.java)| | Medium |HashTable, String|
diff --git a/src/main/java/com/fishercoder/solutions/_1152.java b/src/main/java/com/fishercoder/solutions/_1152.java
@@ -0,0 +1,73 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.TreeMap;
+
+public class _1152 {
+    public static class Solution1 {
+        public List<String> mostVisitedPattern(String[] username, int[] timestamp, String[] website) {
+            Map<String, TreeMap<Integer, String>> userToSiteMap = new HashMap<>();
+            for (int i = 0; i < username.length; i++) {
+                if (!userToSiteMap.containsKey(username[i])) {
+                    userToSiteMap.put(username[i], new TreeMap<>());
+                }
+                TreeMap<Integer, String> timeToSiteMap = userToSiteMap.get(username[i]);
+                timeToSiteMap.put(timestamp[i], website[i]);
+                userToSiteMap.put(username[i], timeToSiteMap);
+            }
+            Map<String, Integer> sequenceCountMap = new HashMap<>();
+            for (String user : userToSiteMap.keySet()) {
+                TreeMap<Integer, String> timeToSiteMap = userToSiteMap.get(user);
+                if (timeToSiteMap.size() < 3) {
+                    continue;
+                } else {
+                    List<Integer> times = new ArrayList<>();
+                    for (int time : timeToSiteMap.keySet()) {
+                        times.add(time);
+                    }
+                    List<String> allSequences = formAllSequences(times, timeToSiteMap);
+                    Set<String> encounteredSequence = new HashSet<>();
+                    for (String sequence : allSequences) {
+                        if (encounteredSequence.add(sequence)) {
+                            sequenceCountMap.put(sequence, sequenceCountMap.getOrDefault(sequence, 0) + 1);
+                        }
+                    }
+                }
+            }
+            List<String> mostVisitedPattern = new ArrayList<>();
+            int count = 0;
+            String result = null;
+            for (String sequence : sequenceCountMap.keySet()) {
+                if (sequenceCountMap.get(sequence) > count) {
+                    result = sequence;
+                    count = sequenceCountMap.get(sequence);
+                } else if (count == sequenceCountMap.get(sequence)) {
+                    if (sequence.compareTo(result) < 0) {
+                        result = sequence;
+                    }
+                }
+            }
+            for (String site : result.split("->")) {
+                mostVisitedPattern.add(site);
+            }
+            return mostVisitedPattern;
+        }
+
+        private List<String> formAllSequences(List<Integer> times, TreeMap<Integer, String> timeToSiteMap) {
+            List<String> result = new ArrayList<>();
+            for (int i = 0; i < times.size() - 2; i++) {
+                for (int j = i + 1; j < times.size() - 1; j++) {
+                    for (int k = j + 1; k < times.size(); k++) {
+                        result.add(timeToSiteMap.get(times.get(i)) + "->" + timeToSiteMap.get(times.get(j)) + "->" + timeToSiteMap.get(times.get(k)));
+                    }
+                }
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1152Test.java b/src/test/java/com/fishercoder/_1152Test.java
@@ -0,0 +1,33 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1152;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1152Test {
+    private static _1152.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1152.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(Arrays.asList("home", "about", "career"), solution1.mostVisitedPattern(new String[]{"joe", "joe", "joe", "james", "james", "james", "james", "mary", "mary", "mary"}, new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, new String[]{"home", "about", "career", "home", "cart", "maps", "home", "home", "about", "career"}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(Arrays.asList("oz", "mryxsjc", "wlarkzzqht"), solution1.mostVisitedPattern(new String[]{"zkiikgv", "zkiikgv", "zkiikgv", "zkiikgv"}, new int[]{436363475, 710406388, 386655081, 797150921}, new String[]{"wnaaxbfhxp", "mryxsjc", "oz", "wlarkzzqht"}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(Arrays.asList("hibympufi", "hibympufi", "yljmntrclw"), solution1.mostVisitedPattern(new String[]{"h", "eiy", "cq", "h", "cq", "txldsscx", "cq", "txldsscx", "h", "cq", "cq"}, new int[]{527896567, 334462937, 517687281, 134127993, 859112386, 159548699, 51100299, 444082139, 926837079, 317455832, 411747930}, new String[]{"hibympufi", "hibympufi", "hibympufi", "hibympufi", "hibympufi", "hibympufi", "hibympufi", "hibympufi", "yljmntrclw", "hibympufi", "yljmntrclw"}));
+    }
+}
