Skip to content

Commit e2acdd3

Browse files
javadevjavadev
authored
Updated exec time 944-954.
1 parent a8d29b5 commit e2acdd3

File tree

12 files changed

+20
-21
lines changed

12 files changed

+20
-21
lines changed

‎README.md

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -875,7 +875,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.16'
875875
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
876876
|-|-|-|-|-|-
877877
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 2 | 69.51
878-
| 0947 |[Most Stones Removed with Same Row or Column](src/main/java/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/Solution.java)| Medium | Depth_First_Search, Graph, Union_Find | 5 | 98.95
878+
| 0947 |[Most Stones Removed with Same Row or Column](src/main/java/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/Solution.java)| Medium | Depth_First_Search, Graph, Union_Find | 7 | 98.83
879879

880880
#### Day 20 Brute Force/Backtracking
881881

@@ -3003,17 +3003,17 @@ implementation 'com.github.javadev:leetcode-in-java:1.16'
30033003
| 0957 |[Prison Cells After N Days](src/main/java/g0901_1000/s0957_prison_cells_after_n_days/Solution.java)| Medium | Array, Hash_Table, Math, Bit_Manipulation | 1 | 97.82
30043004
| 0956 |[Tallest Billboard](src/main/java/g0901_1000/s0956_tallest_billboard/Solution.java)| Hard | Array, Dynamic_Programming | 18 | 92.68
30053005
| 0955 |[Delete Columns to Make Sorted II](src/main/java/g0901_1000/s0955_delete_columns_to_make_sorted_ii/Solution.java)| Medium | Array, String, Greedy | 2 | 68.84
3006-
| 0954 |[Array of Doubled Pairs](src/main/java/g0901_1000/s0954_array_of_doubled_pairs/Solution.java)| Medium | Array, Hash_Table, Sorting, Greedy | 18 | 97.19
3006+
| 0954 |[Array of Doubled Pairs](src/main/java/g0901_1000/s0954_array_of_doubled_pairs/Solution.java)| Medium | Array, Hash_Table, Sorting, Greedy | 13 | 98.71
30073007
| 0953 |[Verifying an Alien Dictionary](src/main/java/g0901_1000/s0953_verifying_an_alien_dictionary/Solution.java)| Easy | Array, String, Hash_Table, Programming_Skills_I_Day_9_String | 0 | 100.00
3008-
| 0952 |[Largest Component Size by Common Factor](src/main/java/g0901_1000/s0952_largest_component_size_by_common_factor/Solution.java)| Hard | Array, Math, Union_Find | 225 | 76.99
3008+
| 0952 |[Largest Component Size by Common Factor](src/main/java/g0901_1000/s0952_largest_component_size_by_common_factor/Solution.java)| Hard | Array, Math, Union_Find | 198 | 92.41
30093009
| 0951 |[Flip Equivalent Binary Trees](src/main/java/g0901_1000/s0951_flip_equivalent_binary_trees/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00
30103010
| 0950 |[Reveal Cards In Increasing Order](src/main/java/g0901_1000/s0950_reveal_cards_in_increasing_order/Solution.java)| Medium | Array, Sorting, Simulation, Queue | 1 | 100.00
3011-
| 0949 |[Largest Time for Given Digits](src/main/java/g0901_1000/s0949_largest_time_for_given_digits/Solution.java)| Medium | String, Enumeration | 3 | 91.21
3012-
| 0948 |[Bag of Tokens](src/main/java/g0901_1000/s0948_bag_of_tokens/Solution.java)| Medium | Array, Sorting, Greedy, Two_Pointers | 4 | 32.05
3013-
| 0947 |[Most Stones Removed with Same Row or Column](src/main/java/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/Solution.java)| Medium | Depth_First_Search, Graph, Union_Find, Level_2_Day_19_Union_Find | 5 | 98.95
3014-
| 0946 |[Validate Stack Sequences](src/main/java/g0901_1000/s0946_validate_stack_sequences/Solution.java)| Medium | Array, Stack, Simulation | 1 | 99.26
3015-
| 0945 |[Minimum Increment to Make Array Unique](src/main/java/g0901_1000/s0945_minimum_increment_to_make_array_unique/Solution.java)| Medium | Array, Sorting, Greedy, Counting | 9 | 95.25
3016-
| 0944 |[Delete Columns to Make Sorted](src/main/java/g0901_1000/s0944_delete_columns_to_make_sorted/Solution.java)| Easy | Array, String | 11 | 59.39
3011+
| 0949 |[Largest Time for Given Digits](src/main/java/g0901_1000/s0949_largest_time_for_given_digits/Solution.java)| Medium | String, Enumeration | 11 | 70.67
3012+
| 0948 |[Bag of Tokens](src/main/java/g0901_1000/s0948_bag_of_tokens/Solution.java)| Medium | Array, Sorting, Greedy, Two_Pointers | 2 | 100.00
3013+
| 0947 |[Most Stones Removed with Same Row or Column](src/main/java/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/Solution.java)| Medium | Depth_First_Search, Graph, Union_Find, Level_2_Day_19_Union_Find | 7 | 98.83
3014+
| 0946 |[Validate Stack Sequences](src/main/java/g0901_1000/s0946_validate_stack_sequences/Solution.java)| Medium | Array, Stack, Simulation | 1 | 98.95
3015+
| 0945 |[Minimum Increment to Make Array Unique](src/main/java/g0901_1000/s0945_minimum_increment_to_make_array_unique/Solution.java)| Medium | Array, Sorting, Greedy, Counting | 5 | 99.79
3016+
| 0944 |[Delete Columns to Make Sorted](src/main/java/g0901_1000/s0944_delete_columns_to_make_sorted/Solution.java)| Easy | Array, String | 9 | 87.09
30173017
| 0943 |[Find the Shortest Superstring](src/main/java/g0901_1000/s0943_find_the_shortest_superstring/Solution.java)| Hard | Array, String, Dynamic_Programming, Bit_Manipulation, Bitmask | 16 | 100.00
30183018
| 0942 |[DI String Match](src/main/java/g0901_1000/s0942_di_string_match/Solution.java)| Easy | Array, String, Math, Greedy, Two_Pointers | 4 | 33.74
30193019
| 0941 |[Valid Mountain Array](src/main/java/g0901_1000/s0941_valid_mountain_array/Solution.java)| Easy | Array | 1 | 100.00

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0944_delete_columns_to_make_sorted;
22

3-
// #Easy #Array #String #2022_02_19_Time_11_ms_(59.39%)_Space_47.6_MB_(27.07%)
3+
// #Easy #Array #String #2022_12_26_Time_9_ms_(87.09%)_Space_42.8_MB_(73.30%)
44

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

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0945_minimum_increment_to_make_array_unique;
22

3-
// #Medium #Array #Sorting #Greedy #Counting #2022_02_20_Time_9_ms_(95.25%)_Space_77.7_MB_(55.09%)
3+
// #Medium #Array #Sorting #Greedy #Counting #2022_12_26_Time_5_ms_(99.79%)_Space_54.1_MB_(76.59%)
44

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

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0946_validate_stack_sequences;
22

3-
// #Medium #Array #Stack #Simulation #2022_07_14_Time_1_ms_(99.26%)_Space_42.2_MB_(83.70%)
3+
// #Medium #Array #Stack #Simulation #2022_12_26_Time_1_ms_(98.95%)_Space_42_MB_(87.24%)
44

55
import java.util.ArrayDeque;
66
import java.util.Deque;

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0901_1000.s0947_most_stones_removed_with_same_row_or_column;
22

33
// #Medium #Depth_First_Search #Graph #Union_Find #Level_2_Day_19_Union_Find
4-
// #2022_02_20_Time_5_ms_(98.95%)_Space_42.1_MB_(74.57%)
4+
// #2022_12_26_Time_7_ms_(98.83%)_Space_42.1_MB_(97.39%)
55

66
import java.util.HashSet;
77

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

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0901_1000.s0948_bag_of_tokens;
22

33
// #Medium #Array #Sorting #Greedy #Two_Pointers
4-
// #2022_02_20_Time_4_ms_(32.05%)_Space_42.9_MB_(28.63%)
4+
// #2022_12_26_Time_2_ms_(100.00%)_Space_42_MB_(85.95%)
55

66
import java.util.Arrays;
77

@@ -11,7 +11,6 @@ public int bagOfTokensScore(int[] tokens, int power) {
1111
int score = 0;
1212
int l = 0;
1313
int r = tokens.length - 1;
14-
1514
while (l <= r) {
1615
if (tokens[l] <= power) {
1716
power -= tokens[l];

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0949_largest_time_for_given_digits;
22

3-
// #Medium #String #Enumeration #2022_02_20_Time_3_ms_(91.21%)_Space_42.3_MB_(24.55%)
3+
// #Medium #String #Enumeration #2022_12_26_Time_11_ms_(70.67%)_Space_42.6_MB_(42.79%)
44

55
public class Solution {
66
public String largestTimeFromDigits(int[] arr) {

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0950_reveal_cards_in_increasing_order;
22

3-
// #Medium #Array #Sorting #Simulation #Queue #2022_03_30_Time_1_ms_(100.00%)_Space_42.6_MB_(83.19%)
3+
// #Medium #Array #Sorting #Simulation #Queue #2022_12_26_Time_1_ms_(100.00%)_Space_42.5_MB_(85.25%)
44

55
import java.util.Arrays;
66

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0901_1000.s0951_flip_equivalent_binary_trees;
22

33
// #Medium #Depth_First_Search #Tree #Binary_Tree
4-
// #2022_03_30_Time_0_ms_(100.00%)_Space_43_MB_(7.64%)
4+
// #2022_12_26_Time_0_ms_(100.00%)_Space_40.2_MB_(73.95%)
55

66
import com_github_leetcode.TreeNode;
77

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0901_1000.s0952_largest_component_size_by_common_factor;
22

3-
// #Hard #Array #Math #Union_Find #2022_02_18_Time_225_ms_(76.99%)_Space_64.2_MB_(65.49%)
3+
// #Hard #Array #Math #Union_Find #2022_12_26_Time_198_ms_(92.41%)_Space_45.8_MB_(96.55%)
44

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

0 commit comments

Comments
 (0)