Added exec time 901-912.

javadev · web-flow · commit 5ee7285e3eab · 2022-03-28T21:30:11.000+03:00
diff --git a/src.save/main/java/g0901_1000/s0901_online_stock_span/StockSpanner.java b/src.save/main/java/g0901_1000/s0901_online_stock_span/StockSpanner.java
@@ -1,6 +1,7 @@
 package g0901_1000.s0901_online_stock_span;
 
 // #Medium #Stack #Design #Monotonic_Stack #Data_Stream
+// #2022_03_28_Time_47_ms_(76.17%)_Space_88.8_MB_(5.16%)
 
 import java.util.Deque;
 import java.util.HashMap;
@@ -33,3 +34,9 @@ public int next(int price) {
         return (index - stocks.peek());
     }
 }
+
+/*
+ * Your StockSpanner object will be instantiated and called as such:
+ * StockSpanner obj = new StockSpanner();
+ * int param_1 = obj.next(price);
+ */
diff --git a/src.save/main/java/g0901_1000/s0902_numbers_at_most_n_given_digit_set/Solution.java b/src.save/main/java/g0901_1000/s0902_numbers_at_most_n_given_digit_set/Solution.java
@@ -1,6 +1,7 @@
 package g0901_1000.s0902_numbers_at_most_n_given_digit_set;
 
 // #Hard #Array #Dynamic_Programming #Math #Binary_Search
+// #2022_03_28_Time_2_ms_(18.29%)_Space_41.8_MB_(22.86%)
 
 public class Solution {
     public int atMostNGivenDigitSet(String[] digits, int n) {
diff --git a/src.save/main/java/g0901_1000/s0903_valid_permutations_for_di_sequence/Solution.java b/src.save/main/java/g0901_1000/s0903_valid_permutations_for_di_sequence/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0903_valid_permutations_for_di_sequence;
 
-// #Hard #Dynamic_Programming
+// #Hard #Dynamic_Programming #2022_03_28_Time_3_ms_(74.00%)_Space_42.9_MB_(46.00%)
 
 public class Solution {
     public int numPermsDISequence(String s) {
diff --git a/src.save/main/java/g0901_1000/s0904_fruit_into_baskets/Solution.java b/src.save/main/java/g0901_1000/s0904_fruit_into_baskets/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0904_fruit_into_baskets;
 
-// #Medium #Array #Hash_Table #Sliding_Window
+// #Medium #Array #Hash_Table #Sliding_Window #2022_03_28_Time_6_ms_(95.60%)_Space_69.2_MB_(76.55%)
 
 public class Solution {
     public int totalFruit(int[] fruits) {
diff --git a/src.save/main/java/g0901_1000/s0905_sort_array_by_parity/Solution.java b/src.save/main/java/g0901_1000/s0905_sort_array_by_parity/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0905_sort_array_by_parity;
 
-// #Easy #Array #Sorting #Two_Pointers
+// #Easy #Array #Sorting #Two_Pointers #2022_03_28_Time_1_ms_(95.51%)_Space_48.4_MB_(46.34%)
 
 public class Solution {
     public int[] sortArrayByParity(int[] nums) {
diff --git a/src.save/main/java/g0901_1000/s0906_super_palindromes/Solution.java b/src.save/main/java/g0901_1000/s0906_super_palindromes/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0906_super_palindromes;
 
-// #Hard #Math #Enumeration
+// #Hard #Math #Enumeration #2022_03_28_Time_229_ms_(91.38%)_Space_42_MB_(93.10%)
 
 public class Solution {
     public int superpalindromesInRange(String left, String right) {
diff --git a/src.save/main/java/g0901_1000/s0907_sum_of_subarray_minimums/Solution.java b/src.save/main/java/g0901_1000/s0907_sum_of_subarray_minimums/Solution.java
@@ -1,6 +1,7 @@
 package g0901_1000.s0907_sum_of_subarray_minimums;
 
 // #Medium #Array #Dynamic_Programming #Stack #Monotonic_Stack
+// #2022_03_28_Time_20_ms_(95.88%)_Space_64_MB_(76.91%)
 
 public class Solution {
     private static final int MOD = 1_000_000_007;
diff --git a/src.save/main/java/g0901_1000/s0908_smallest_range_i/Solution.java b/src.save/main/java/g0901_1000/s0908_smallest_range_i/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0908_smallest_range_i;
 
-// #Easy #Array #Math
+// #Easy #Array #Math #2022_03_28_Time_2_ms_(88.84%)_Space_41.9_MB_(99.76%)
 
 public class Solution {
     public int smallestRangeI(int[] nums, int k) {
diff --git a/src.save/main/java/g0901_1000/s0909_snakes_and_ladders/Solution.java b/src.save/main/java/g0901_1000/s0909_snakes_and_ladders/Solution.java
@@ -1,6 +1,7 @@
 package g0901_1000.s0909_snakes_and_ladders;
 
 // #Medium #Array #Breadth_First_Search #Matrix
+// #2022_03_28_Time_7_ms_(79.52%)_Space_47.7_MB_(58.43%)
 
 import java.util.LinkedList;
 import java.util.Queue;
diff --git a/src.save/main/java/g0901_1000/s0910_smallest_range_ii/Solution.java b/src.save/main/java/g0901_1000/s0910_smallest_range_ii/Solution.java
@@ -1,6 +1,7 @@
 package g0901_1000.s0910_smallest_range_ii;
 
-// #Medium #Array #Math #Sorting #Greedy
+// #Medium #Array #Math #Sorting #Greedy #Programming_Skills_II_Day_13
+// #2022_03_28_Time_10_ms_(73.16%)_Space_49.6_MB_(38.97%)
 
 import java.util.Arrays;
 
diff --git a/src.save/main/java/g0901_1000/s0911_online_election/TopVotedCandidate.java b/src.save/main/java/g0901_1000/s0911_online_election/TopVotedCandidate.java
@@ -1,6 +1,7 @@
 package g0901_1000.s0911_online_election;
 
 // #Medium #Array #Hash_Table #Binary_Search #Design
+// #2022_03_28_Time_63_ms_(98.81%)_Space_50.5_MB_(99.53%)
 
 public class TopVotedCandidate {
     private final int[] times;
@@ -45,3 +46,9 @@ public int q(int t) {
         return winnersAtTimeT[lo];
     }
 }
+
+/*
+ * Your TopVotedCandidate object will be instantiated and called as such:
+ * TopVotedCandidate obj = new TopVotedCandidate(persons, times);
+ * int param_1 = obj.q(t);
+ */
diff --git a/src.save/main/java/g0901_1000/s0912_sort_an_array/Solution.java b/src.save/main/java/g0901_1000/s0912_sort_an_array/Solution.java
@@ -1,7 +1,7 @@
 package g0901_1000.s0912_sort_an_array;
 
 // #Medium #Array #Sorting #Heap_Priority_Queue #Divide_and_Conquer #Merge_Sort #Bucket_Sort
-// #Counting_Sort #Radix_Sort
+// #Counting_Sort #Radix_Sort #2022_03_28_Time_25_ms_(38.15%)_Space_69.7_MB_(46.69%)
 
 public class Solution {
     public int[] sortArray(int[] nums) {
