Updated exec time 1155-1169

Author: javadev

src/main/java/g1101_1200/s1155_number_of_dice_rolls_with_target_sum/Solution.java

@@ -1,6 +1,6 @@
 package g1101_1200.s1155_number_of_dice_rolls_with_target_sum;
 
-// #Medium #Dynamic_Programming #2022_03_05_Time_17_ms_(78.89%)_Space_43.1_MB_(25.85%)
+// #Medium #Dynamic_Programming #2023_06_02_Time_15_ms_(84.85%)_Space_40.7_MB_(90.40%)
 
 import java.util.Arrays;
 

src/main/java/g1101_1200/s1156_swap_for_longest_repeated_character_substring/Solution.java

@@ -1,6 +1,6 @@
 package g1101_1200.s1156_swap_for_longest_repeated_character_substring;
 
-// #Medium #String #Sliding_Window #2022_05_05_Time_12_ms_(47.37%)_Space_44.1_MB_(22.11%)
+// #Medium #String #Sliding_Window #2023_06_02_Time_14_ms_(43.18%)_Space_43.8_MB_(6.82%)
 
 import java.util.ArrayList;
 import java.util.HashMap;

src/main/java/g1101_1200/s1157_online_majority_element_in_subarray/MajorityChecker.java

@@ -1,7 +1,7 @@
 package g1101_1200.s1157_online_majority_element_in_subarray;
 
 // #Hard #Array #Binary_Search #Design #Segment_Tree #Binary_Indexed_Tree
-// #2022_03_05_Time_56_ms_(100.00%)_Space_50.3_MB_(92.06%)
+// #2023_06_02_Time_108_ms_(95.24%)_Space_58.6_MB_(20.64%)
 
 import java.util.ArrayList;
 import java.util.Collections;

src/main/java/g1101_1200/s1158_market_analysis_i/script.sql

@@ -1,6 +1,6 @@
 # Write your MySQL query statement below
 # #Medium #Database #SQL_I_Day_9_Control_of_Flow
-# #2022_05_24_Time_1039_ms_(77.70%)_Space_0B_(100.00%)
+# #2023_06_02_Time_2919_ms_(12.20%)_Space_0B_(100.00%)
 SELECT U.user_id AS buyer_id, U.join_date, IFNULL(USERS_ORDERED_IN_2019.orders_in_2019, 0) AS orders_in_2019 FROM Users U
 LEFT JOIN (SELECT U.user_id AS user_id, COUNT(O.item_id) AS orders_in_2019 FROM Users U
 LEFT JOIN Orders O ON O.buyer_id = U.user_id

src/main/java/g1101_1200/s1160_find_words_that_can_be_formed_by_characters/Solution.java

@@ -1,6 +1,6 @@
 package g1101_1200.s1160_find_words_that_can_be_formed_by_characters;
 
-// #Easy #Array #String #Hash_Table #2022_03_05_Time_53_ms_(30.13%)_Space_63.8_MB_(11.65%)
+// #Easy #Array #String #Hash_Table #2023_06_02_Time_31_ms_(42.06%)_Space_44.7_MB_(5.60%)
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.java

@@ -1,7 +1,7 @@
 package g1101_1200.s1161_maximum_level_sum_of_a_binary_tree;
 
 // #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
-// #2022_03_05_Time_9_ms_(78.65%)_Space_71.4_MB_(44.72%)
+// #2023_06_02_Time_7_ms_(97.19%)_Space_46.3_MB_(31.31%)
 
 import com_github_leetcode.TreeNode;
 import java.util.ArrayList;

src/main/java/g1101_1200/s1162_as_far_from_land_as_possible/Solution.java

@@ -2,7 +2,7 @@
 
 // #Medium #Array #Dynamic_Programming #Breadth_First_Search #Matrix
 // #Graph_Theory_I_Day_4_Matrix_Related_Problems
-// #2022_03_05_Time_12_ms_(89.17%)_Space_42.6_MB_(90.73%)
+// #2023_06_02_Time_16_ms_(62.40%)_Space_44_MB_(42.90%)
 
 import java.util.LinkedList;
 import java.util.Objects;

src/main/java/g1101_1200/s1163_last_substring_in_lexicographical_order/Solution.java

@@ -1,30 +1,26 @@
 package g1101_1200.s1163_last_substring_in_lexicographical_order;
 
-// #Hard #String #Two_Pointers #2022_03_05_Time_12_ms_(96.43%)_Space_58.6_MB_(8.93%)
+// #Hard #String #Two_Pointers #2023_06_02_Time_10_ms_(97.22%)_Space_45.5_MB_(83.33%)
 
 public class Solution {
-    public String lastSubstring(String str) {
-        char[] s = str.toCharArray();
+    public String lastSubstring(String s) {
         int i = 0;
-        int j = i + 1;
-        int l = 0;
-        int n = s.length;
-        while (j + l < n) {
-            if (s[i + l] == s[j + l]) {
-                l++;
+        int j = 1;
+        int k = 0;
+        int n = s.length();
+        char[] ca = s.toCharArray();
+        while (j + k < n) {
+            if (ca[i + k] == ca[j + k]) {
+                k++;
+            } else if (ca[i + k] > ca[j + k]) {
+                j = j + k + 1;
+                k = 0;
             } else {
-                if (s[i + l] <= s[j + l]) {
-                    if (s[j + l] > s[i]) {
-                        i = j + l;
-                    } else {
-                        int p = j - i;
-                        i = j + (l / p) * p;
-                    }
-                }
-                j = j + l + 1;
-                l = 0;
+                i = Math.max(i + k + 1, j);
+                j = i + 1;
+                k = 0;
             }
         }
-        return str.substring(i);
+        return s.substring(i);
     }
 }

src/main/java/g1101_1200/s1169_invalid_transactions/Solution.java

@@ -1,54 +1,59 @@
 package g1101_1200.s1169_invalid_transactions;
 
-// #Medium #Array #String #Hash_Table #Sorting
-// #2022_03_05_Time_11_ms_(89.89%)_Space_43.2_MB_(79.45%)
+// #Medium #Array #String #Hash_Table #Sorting #2023_06_02_Time_9_ms_(98.31%)_Space_44.9_MB_(7.40%)
 
 import java.util.ArrayList;
 import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
-import java.util.TreeMap;
 
 public class Solution {
-    public List<String> invalidTransactions(String[] transactions) {
-        Map<String, TreeMap<Integer, Transaction>> map = new HashMap<>();
-        List<String> result = new ArrayList<>();
-        for (String transaction : transactions) {
-            String[] split = transaction.split(",");
-            String name = split[0];
-            int time = Integer.parseInt(split[1]);
-            String city = split[3];
-            map.putIfAbsent(name, new TreeMap<>());
-            map.get(name).put(time, new Transaction(time, city));
+    private static class Transaction {
+        String name;
+        int time;
+        int amount;
+        String city;
+
+        Transaction(String trans) {
+            String[] s = trans.split(",");
+            name = s[0];
+            time = Integer.parseInt(s[1]);
+            amount = Integer.parseInt(s[2]);
+            city = s[3];
+        }
+    }
+
+    public List<String> invalidTransactions(String[] input) {
+        List<String> res = new ArrayList<>();
+        if (input == null || input.length == 0) {
+            return res;
         }
-        for (String transaction : transactions) {
-            String[] split = transaction.split(",");
-            String name = split[0];
-            int time = Integer.parseInt(split[1]);
-            int amount = Integer.parseInt(split[2]);
-            String city = split[3];
-            if (amount > 1000) {
-                result.add(transaction);
-                continue;
+        Map<String, List<Transaction>> map = new HashMap<>();
+        for (String s : input) {
+            Transaction trans = new Transaction(s);
+            if (!map.containsKey(trans.name)) {
+                map.put(trans.name, new ArrayList<>());
             }
-            for (Map.Entry<Integer, Transaction> entry :
-                    map.get(name).subMap(time - 60, time + 60).entrySet()) {
-                if (Math.abs(time - entry.getKey()) <= 60 && !entry.getValue().city.equals(city)) {
-                    result.add(transaction);
-                    break;
-                }
+            map.get(trans.name).add(trans);
+        }
+        for (String s : input) {
+            Transaction trans = new Transaction(s);
+            if (!isValid(trans, map)) {
+                res.add(s);
             }
         }
-        return result;
+        return res;
     }
 
-    private static class Transaction {
-        int amount;
-        String city;
-
-        public Transaction(int amount, String city) {
-            this.amount = amount;
-            this.city = city;
+    private boolean isValid(Transaction transaction, Map<String, List<Transaction>> map) {
+        if (transaction.amount > 1000) {
+            return false;
+        }
+        for (Transaction s : map.get(transaction.name)) {
+            if (Math.abs(s.time - transaction.time) <= 60 && !s.city.equals(transaction.city)) {
+                return false;
+            }
         }
+        return true;
     }
 }