Skip to content

Commit ee8b127

Browse files
javadevjavadev
authored
Added exec time 960-999.
1 parent f4dda6c commit ee8b127

File tree

39 files changed

+45
-21
lines changed

39 files changed

+45
-21
lines changed

‎src/main/java/g0901_1000/s0960_delete_columns_to_make_sorted_iii/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0960_delete_columns_to_make_sorted_iii;
22

3-
// #Hard #Array #String #Dynamic_Programming
3+
// #Hard #Array #String #Dynamic_Programming #2022_03_31_Time_13_ms_(43.86%)_Space_44.3_MB_(8.77%)
44

55
public class Solution {
66
public int minDeletionSize(String[] strs) {

‎src/main/java/g0901_1000/s0961_n_repeated_element_in_size_2n_array/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0961_n_repeated_element_in_size_2n_array;
22

3-
// #Easy #Array #Hash_Table
3+
// #Easy #Array #Hash_Table #2022_03_31_Time_1_ms_(87.33%)_Space_54.1_MB_(66.98%)
44

55
import java.util.HashSet;
66
import java.util.Set;

‎src/main/java/g0901_1000/s0962_maximum_width_ramp/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0962_maximum_width_ramp;
22

3-
// #Medium #Array #Stack #Monotonic_Stack
3+
// #Medium #Array #Stack #Monotonic_Stack #2022_03_31_Time_6_ms_(90.69%)_Space_57.6_MB_(36.44%)
44

55
public class Solution {
66
public int maxWidthRamp(int[] nums) {

‎src/main/java/g0901_1000/s0963_minimum_area_rectangle_ii/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0963_minimum_area_rectangle_ii;
22

3-
// #Medium #Array #Math #Geometry
3+
// #Medium #Array #Math #Geometry #2022_03_31_Time_12_ms_(92.95%)_Space_43.1_MB_(83.55%)
44

55
import java.util.HashMap;
66
import java.util.HashSet;

‎src/main/java/g0901_1000/s0964_least_operators_to_express_number/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0964_least_operators_to_express_number;
22

3-
// #Hard #Dynamic_Programming #Math
3+
// #Hard #Dynamic_Programming #Math #2022_03_31_Time_16_ms_(37.78%)_Space_43.4_MB_(11.11%)
44

55
import java.util.HashMap;
66
import java.util.Map;

‎src/main/java/g0901_1000/s0965_univalued_binary_tree/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0965_univalued_binary_tree;
22

33
// #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
4+
// #2022_03_31_Time_1_ms_(17.57%)_Space_42.1_MB_(20.22%)
45

56
import com_github_leetcode.TreeNode;
67
import java.util.LinkedList;

‎src/main/java/g0901_1000/s0966_vowel_spellchecker/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0966_vowel_spellchecker;
22

3-
// #Medium #Array #String #Hash_Table
3+
// #Medium #Array #String #Hash_Table #2022_03_31_Time_17_ms_(98.95%)_Space_46.7_MB_(91.62%)
44

55
import java.util.HashMap;
66
import java.util.HashSet;

‎src/main/java/g0901_1000/s0967_numbers_with_same_consecutive_differences/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0967_numbers_with_same_consecutive_differences;
22

33
// #Medium #Breadth_First_Search #Backtracking
4+
// #2022_03_31_Time_1_ms_(100.00%)_Space_43.2_MB_(35.45%)
45

56
import java.util.ArrayList;
67
import java.util.List;

‎src/main/java/g0901_1000/s0968_binary_tree_cameras/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0968_binary_tree_cameras;
22

33
// #Hard #Dynamic_Programming #Depth_First_Search #Tree #Binary_Tree
4+
// #2022_03_31_Time_0_ms_(100.00%)_Space_41.4_MB_(98.84%)
45

56
import com_github_leetcode.TreeNode;
67

‎src/main/java/g0901_1000/s0969_pancake_sorting/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0969_pancake_sorting;
22

33
// #Medium #Array #Sorting #Greedy #Two_Pointers
4+
// #2022_03_31_Time_1_ms_(100.00%)_Space_42.2_MB_(88.99%)
45

56
import java.util.ArrayList;
67
import java.util.List;

‎src/main/java/g0901_1000/s0970_powerful_integers/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0970_powerful_integers;
22

3-
// #Medium #Hash_Table #Math
3+
// #Medium #Hash_Table #Math #2022_03_31_Time_1_ms_(100.00%)_Space_42.3_MB_(27.54%)
44

55
import java.util.ArrayList;
66
import java.util.HashSet;

‎src/main/java/g0901_1000/s0971_flip_binary_tree_to_match_preorder_traversal/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0971_flip_binary_tree_to_match_preorder_traversal;
22

33
// #Medium #Depth_First_Search #Tree #Binary_Tree
4+
// #2022_03_31_Time_0_ms_(100.00%)_Space_43.3_MB_(30.85%)
45

56
import com_github_leetcode.TreeNode;
67
import java.util.ArrayList;

‎src/main/java/g0901_1000/s0972_equal_rational_numbers/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0972_equal_rational_numbers;
22

3-
// #Hard #String #Math
3+
// #Hard #String #Math #2022_03_31_Time_4_ms_(56.67%)_Space_43.5_MB_(6.67%)
44

55
public class Solution {
66
public boolean isRationalEqual(String s, String t) {

‎src/main/java/g0901_1000/s0973_k_closest_points_to_origin/Solution.java

+2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,8 @@
11
package g0901_1000.s0973_k_closest_points_to_origin;
22

33
// #Medium #Array #Math #Sorting #Heap_Priority_Queue #Divide_and_Conquer #Geometry #Quickselect
4+
// #Data_Structure_II_Day_21_Heap_Priority_Queue #Programming_Skills_II_Day_8
5+
// #2022_03_31_Time_4_ms_(98.26%)_Space_112.9_MB_(78.08%)
46

57
import java.util.Arrays;
68

‎src/main/java/g0901_1000/s0974_subarray_sums_divisible_by_k/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0974_subarray_sums_divisible_by_k;
22

3-
// #Medium #Array #Hash_Table #Prefix_Sum
3+
// #Medium #Array #Hash_Table #Prefix_Sum #2022_03_31_Time_3_ms_(99.95%)_Space_46.1_MB_(95.83%)
44

55
public class Solution {
66
public int subarraysDivByK(int[] nums, int k) {

‎src/main/java/g0901_1000/s0975_odd_even_jump/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0975_odd_even_jump;
22

33
// #Hard #Array #Dynamic_Programming #Stack #Monotonic_Stack #Ordered_Set
4+
// #2022_03_31_Time_49_ms_(98.38%)_Space_69.1_MB_(5.18%)
45

56
import java.util.Arrays;
67

‎src/main/java/g0901_1000/s0976_largest_perimeter_triangle/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0976_largest_perimeter_triangle;
22

3-
// #Easy #Array #Math #Sorting #Greedy
3+
// #Easy #Array #Math #Sorting #Greedy #Programming_Skills_I_Day_3_Conditional_Statements
4+
// #2022_03_31_Time_12_ms_(26.01%)_Space_53.8_MB_(69.91%)
45

56
import java.util.Arrays;
67

‎src/main/java/g0901_1000/s0977_squares_of_a_sorted_array/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0977_squares_of_a_sorted_array;
22

3-
// #Easy #Array #Sorting #Two_Pointers
3+
// #Easy #Array #Sorting #Two_Pointers #Algorithm_I_Day_2_Two_Pointers
4+
// #2022_03_31_Time_1_ms_(100.00%)_Space_44.1_MB_(84.57%)
45

56
public class Solution {
67
public int[] sortedSquares(int[] nums) {

‎src/main/java/g0901_1000/s0978_longest_turbulent_subarray/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0978_longest_turbulent_subarray;
22

33
// #Medium #Array #Dynamic_Programming #Sliding_Window
4+
// #2022_03_31_Time_7_ms_(48.10%)_Space_67.3_MB_(35.67%)
45

56
public class Solution {
67
public int maxTurbulenceSize(int[] arr) {

‎src/main/java/g0901_1000/s0979_distribute_coins_in_binary_tree/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0979_distribute_coins_in_binary_tree;
22

33
// #Medium #Depth_First_Search #Tree #Binary_Tree
4+
// #2022_03_31_Time_0_ms_(100.00%)_Space_41.8_MB_(85.81%)
45

56
import com_github_leetcode.TreeNode;
67

‎src/main/java/g0901_1000/s0980_unique_paths_iii/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0980_unique_paths_iii;
22

33
// #Hard #Array #Matrix #Bit_Manipulation #Backtracking
4+
// #2022_03_31_Time_0_ms_(100.00%)_Space_39.3_MB_(98.32%)
45

56
public class Solution {
67
private final int[] row = {0, 0, 1, -1};

‎src/main/java/g0901_1000/s0981_time_based_key_value_store/TimeMap.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0981_time_based_key_value_store;
22

33
// #Medium #String #Hash_Table #Binary_Search #Design
4+
// #2022_03_31_Time_239_ms_(72.78%)_Space_213.8_MB_(76.88%)
45

56
import java.util.ArrayList;
67
import java.util.HashMap;

‎src/main/java/g0901_1000/s0982_triples_with_bitwise_and_equal_to_zero/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0982_triples_with_bitwise_and_equal_to_zero;
22

33
// #Hard #Array #Hash_Table #Bit_Manipulation
4+
// #2022_03_31_Time_120_ms_(79.59%)_Space_55.5_MB_(18.37%)
45

56
public class Solution {
67
public int countTriplets(int[] nums) {

‎src/main/java/g0901_1000/s0983_minimum_cost_for_tickets/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0983_minimum_cost_for_tickets;
22

3-
// #Medium #Array #Dynamic_Programming
3+
// #Medium #Array #Dynamic_Programming #2022_03_31_Time_1_ms_(93.95%)_Space_42.5_MB_(28.58%)
44

55
public class Solution {
66
public int mincostTickets(int[] days, int[] costs) {

‎src/main/java/g0901_1000/s0984_string_without_aaa_or_bbb/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0984_string_without_aaa_or_bbb;
22

3-
// #Medium #String #Greedy
3+
// #Medium #String #Greedy #2022_03_31_Time_0_ms_(100.00%)_Space_39.7_MB_(86.30%)
44

55
public class Solution {
66
public String strWithout3a3b(int a, int b) {

‎src/main/java/g0901_1000/s0985_sum_of_even_numbers_after_queries/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0985_sum_of_even_numbers_after_queries;
22

3-
// #Medium #Array #Simulation
3+
// #Medium #Array #Simulation #2022_03_31_Time_6_ms_(71.11%)_Space_74.1_MB_(22.54%)
44

55
public class Solution {
66
public int[] sumEvenAfterQueries(int[] nums, int[][] queries) {

‎src/main/java/g0901_1000/s0986_interval_list_intersections/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0986_interval_list_intersections;
22

3-
// #Medium #Array #Two_Pointers
3+
// #Medium #Array #Two_Pointers #Algorithm_II_Day_4_Two_Pointers
4+
// #2022_03_31_Time_2_ms_(99.95%)_Space_43.1_MB_(85.56%)
45

56
import java.util.ArrayList;
67

‎src/main/java/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0987_vertical_order_traversal_of_a_binary_tree;
22

33
// #Hard #Hash_Table #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
4+
// #2022_03_31_Time_4_ms_(71.48%)_Space_44.1_MB_(6.86%)
45

56
import com_github_leetcode.TreeNode;
67
import java.util.ArrayList;

‎src/main/java/g0901_1000/s0988_smallest_string_starting_from_leaf/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0988_smallest_string_starting_from_leaf;
22

33
// #Medium #String #Depth_First_Search #Tree #Binary_Tree
4+
// #2022_03_31_Time_4_ms_(58.47%)_Space_44.1_MB_(60.60%)
45

56
import com_github_leetcode.TreeNode;
67

‎src/main/java/g0901_1000/s0989_add_to_array_form_of_integer/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0989_add_to_array_form_of_integer;
22

3-
// #Easy #Array #Math
3+
// #Easy #Array #Math #Programming_Skills_II_Day_5
4+
// #2022_03_31_Time_7_ms_(65.92%)_Space_62.4_MB_(29.05%)
45

56
import java.util.ArrayList;
67
import java.util.Collections;

‎src/main/java/g0901_1000/s0990_satisfiability_of_equality_equations/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0990_satisfiability_of_equality_equations;
22

3-
// #Medium #Array #String #Graph #Union_Find
3+
// #Medium #Array #String #Graph #Union_Find #2022_03_31_Time_5_ms_(24.79%)_Space_43.5_MB_(18.67%)
44

55
import java.util.HashMap;
66

‎src/main/java/g0901_1000/s0991_broken_calculator/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0991_broken_calculator;
22

3-
// #Medium #Math #Greedy
3+
// #Medium #Math #Greedy #2022_03_31_Time_0_ms_(100.00%)_Space_41.1_MB_(40.35%)
44

55
public class Solution {
66
public int brokenCalc(int startValue, int target) {

‎src/main/java/g0901_1000/s0992_subarrays_with_k_different_integers/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0992_subarrays_with_k_different_integers;
22

33
// #Hard #Array #Hash_Table #Sliding_Window #Counting
4+
// #2022_03_31_Time_4_ms_(99.36%)_Space_46.2_MB_(86.91%)
45

56
public class Solution {
67
public int subarraysWithKDistinct(int[] nums, int k) {

‎src/main/java/g0901_1000/s0993_cousins_in_binary_tree/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0993_cousins_in_binary_tree;
22

33
// #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
4+
// #2022_03_31_Time_1_ms_(60.08%)_Space_42.3_MB_(27.64%)
45

56
import com_github_leetcode.TreeNode;
67

‎src/main/java/g0901_1000/s0995_minimum_number_of_k_consecutive_bit_flips/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0995_minimum_number_of_k_consecutive_bit_flips;
22

33
// #Hard #Array #Bit_Manipulation #Prefix_Sum #Sliding_Window
4+
// #2022_03_31_Time_6_ms_(93.95%)_Space_50.3_MB_(97.13%)
45

56
public class Solution {
67
public int minKBitFlips(int[] nums, int k) {

‎src/main/java/g0901_1000/s0996_number_of_squareful_arrays/Solution.java

+1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0996_number_of_squareful_arrays;
22

33
// #Hard #Array #Dynamic_Programming #Math #Bit_Manipulation #Backtracking #Bitmask
4+
// #2022_03_31_Time_2_ms_(72.32%)_Space_41.9_MB_(32.14%)
45

56
import java.util.HashSet;
67
import java.util.Set;

‎src/main/java/g0901_1000/s0997_find_the_town_judge/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0901_1000.s0997_find_the_town_judge;
22

3-
// #Easy #Array #Hash_Table #Graph
3+
// #Easy #Array #Hash_Table #Graph #Data_Structure_II_Day_19_Graph
4+
// #Graph_Theory_I_Day_13_Graph_Theory #2022_03_31_Time_3_ms_(80.64%)_Space_49.9_MB_(88.09%)
45

56
public class Solution {
67
public int findJudge(int n, int[][] trust) {

‎src/main/java/g0901_1000/s0998_maximum_binary_tree_ii/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0998_maximum_binary_tree_ii;
22

3-
// #Medium #Tree #Binary_Tree
3+
// #Medium #Tree #Binary_Tree #2022_03_31_Time_0_ms_(100.00%)_Space_42.1_MB_(56.35%)
44

55
import com_github_leetcode.TreeNode;
66

‎src/main/java/g0901_1000/s0999_available_captures_for_rook/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0999_available_captures_for_rook;
22

3-
// #Easy #Array #Matrix #Simulation
3+
// #Easy #Array #Matrix #Simulation #2022_03_31_Time_0_ms_(100.00%)_Space_41.8_MB_(28.74%)
44

55
@SuppressWarnings("java:S135")
66
public class Solution {

0 commit comments

Comments
 (0)