Skip to content

Commit 739a4e8

Browse files
javadevjavadev
authored
Updated exec time 521-532.
1 parent 2c56ec7 commit 739a4e8

File tree

11 files changed

+26
-20
lines changed

11 files changed

+26
-20
lines changed

‎README.md

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -639,7 +639,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
639639
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
640640
|-|-|-|-|-|-
641641
| 0154 |[Find Minimum in Rotated Sorted Array II](src/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.java)| Hard | Array, Binary_Search | 1 | 77.09
642-
| 0528 |[Random Pick with Weight](src/main/java/g0501_0600/s0528_random_pick_with_weight/Solution.java)| Medium | Math, Binary_Search, Prefix_Sum, Randomized | 29 | 83.26
642+
| 0528 |[Random Pick with Weight](src/main/java/g0501_0600/s0528_random_pick_with_weight/Solution.java)| Medium | Math, Binary_Search, Prefix_Sum, Randomized | 42 | 50.90
643643

644644
#### Day 14
645645

@@ -1584,7 +1584,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
15841584
| 0442 |[Find All Duplicates in an Array](src/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.java)| Medium | Array, Hash_Table | 5 | 98.83
15851585
| 0041 |[First Missing Positive](src/main/java/g0001_0100/s0041_first_missing_positive/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table | 5 | 50.34
15861586
| 0697 |[Degree of an Array](src/main/java/g0601_0700/s0697_degree_of_an_array/Solution.java)| Easy | Array, Hash_Table | 14 | 93.19
1587-
| 0532 |[K-diff Pairs in an Array](src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array/Solution.java)| Medium | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 14 | 49.69
1587+
| 0532 |[K-diff Pairs in an Array](src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array/Solution.java)| Medium | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 13 | 58.23
15881588
| 0713 |[Subarray Product Less Than K](src/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java)| Medium | Array, Sliding_Window | 8 | 39.00
15891589
| 1007 |[Minimum Domino Rotations For Equal Row](src/main/java/g1001_1100/s1007_minimum_domino_rotations_for_equal_row/Solution.java)| Medium | Array, Greedy | 5 | 79.64
15901590
| 1306 |[Jump Game III](src/main/java/g1301_1400/s1306_jump_game_iii/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search | 2 | 96.23
@@ -3263,15 +3263,15 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
32633263
| 0538 |[Convert BST to Greater Tree](src/main/java/g0501_0600/s0538_convert_bst_to_greater_tree/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 1 | 83.78
32643264
| 0537 |[Complex Number Multiplication](src/main/java/g0501_0600/s0537_complex_number_multiplication/Solution.java)| Medium | String, Math, Simulation | 7 | 62.22
32653265
| 0535 |[Encode and Decode TinyURL](src/main/java/g0501_0600/s0535_encode_and_decode_tinyurl/Codec.java)| Medium | String, Hash_Table, Design, Hash_Function | 4 | 65.42
3266-
| 0532 |[K-diff Pairs in an Array](src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array/Solution.java)| Medium | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers, Udemy_Arrays | 14 | 49.69
3267-
| 0530 |[Minimum Absolute Difference in BST](src/main/java/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00
3266+
| 0532 |[K-diff Pairs in an Array](src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array/Solution.java)| Medium | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers, Udemy_Arrays | 13 | 58.23
3267+
| 0530 |[Minimum Absolute Difference in BST](src/main/java/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 1 | 92.05
32683268
| 0529 |[Minesweeper](src/main/java/g0501_0600/s0529_minesweeper/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 0 | 100.00
3269-
| 0528 |[Random Pick with Weight](src/main/java/g0501_0600/s0528_random_pick_with_weight/Solution.java)| Medium | Math, Binary_Search, Prefix_Sum, Randomized, Binary_Search_II_Day_13 | 29 | 83.26
3270-
| 0526 |[Beautiful Arrangement](src/main/java/g0501_0600/s0526_beautiful_arrangement/Solution.java)| Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 3 | 98.99
3271-
| 0525 |[Contiguous Array](src/main/java/g0501_0600/s0525_contiguous_array/Solution.java)| Medium | Array, Hash_Table, Prefix_Sum | 17 | 92.02
3272-
| 0524 |[Longest Word in Dictionary through Deleting](src/main/java/g0501_0600/s0524_longest_word_in_dictionary_through_deleting/Solution.java)| Medium | Array, String, Sorting, Two_Pointers | 10 | 97.43
3273-
| 0523 |[Continuous Subarray Sum](src/main/java/g0501_0600/s0523_continuous_subarray_sum/Solution.java)| Medium | Array, Hash_Table, Math, Prefix_Sum | 25 | 78.40
3274-
| 0522 |[Longest Uncommon Subsequence II](src/main/java/g0501_0600/s0522_longest_uncommon_subsequence_ii/Solution.java)| Medium | Array, String, Hash_Table, Sorting, Two_Pointers | 1 | 100.00
3269+
| 0528 |[Random Pick with Weight](src/main/java/g0501_0600/s0528_random_pick_with_weight/Solution.java)| Medium | Math, Binary_Search, Prefix_Sum, Randomized, Binary_Search_II_Day_13 | 42 | 50.90
3270+
| 0526 |[Beautiful Arrangement](src/main/java/g0501_0600/s0526_beautiful_arrangement/Solution.java)| Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 3 | 98.66
3271+
| 0525 |[Contiguous Array](src/main/java/g0501_0600/s0525_contiguous_array/Solution.java)| Medium | Array, Hash_Table, Prefix_Sum | 31 | 80.05
3272+
| 0524 |[Longest Word in Dictionary through Deleting](src/main/java/g0501_0600/s0524_longest_word_in_dictionary_through_deleting/Solution.java)| Medium | Array, String, Sorting, Two_Pointers | 19 | 89.67
3273+
| 0523 |[Continuous Subarray Sum](src/main/java/g0501_0600/s0523_continuous_subarray_sum/Solution.java)| Medium | Array, Hash_Table, Math, Prefix_Sum | 37 | 41.45
3274+
| 0522 |[Longest Uncommon Subsequence II](src/main/java/g0501_0600/s0522_longest_uncommon_subsequence_ii/Solution.java)| Medium | Array, String, Hash_Table, Sorting, Two_Pointers | 1 | 99.61
32753275
| 0521 |[Longest Uncommon Subsequence I](src/main/java/g0501_0600/s0521_longest_uncommon_subsequence_i/Solution.java)| Easy | String | 0 | 100.00
32763276
| 0520 |[Detect Capital](src/main/java/g0501_0600/s0520_detect_capital/Solution.java)| Easy | String | 2 | 65.95
32773277
| 0519 |[Random Flip Matrix](src/main/java/g0501_0600/s0519_random_flip_matrix/Solution.java)| Medium | Hash_Table, Math, Randomized, Reservoir_Sampling | 38 | 79.28

‎src/main/java/g0501_0600/s0521_longest_uncommon_subsequence_i/Solution.java

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

3-
// #Easy #String #2022_03_20_Time_0_ms_(100.00%)_Space_42.6_MB_(6.24%)
3+
// #Easy #String #2022_07_28_Time_0_ms_(100.00%)_Space_40.2_MB_(87.89%)
44

55
public class Solution {
66
/*

‎src/main/java/g0501_0600/s0522_longest_uncommon_subsequence_ii/Solution.java

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

33
// #Medium #Array #String #Hash_Table #Sorting #Two_Pointers
4-
// #2022_03_20_Time_1_ms_(100.00%)_Space_42.6_MB_(5.73%)
4+
// #2022_07_28_Time_1_ms_(99.61%)_Space_41.7_MB_(40.70%)
55

66
public class Solution {
77
public int findLUSlength(String[] strs) {

‎src/main/java/g0501_0600/s0523_continuous_subarray_sum/Solution.java

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

33
// #Medium #Array #Hash_Table #Math #Prefix_Sum
4-
// #2022_03_20_Time_25_ms_(78.40%)_Space_90.4_MB_(67.54%)
4+
// #2022_07_28_Time_37_ms_(41.45%)_Space_109.7_MB_(5.07%)
55

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

‎src/main/java/g0501_0600/s0524_longest_word_in_dictionary_through_deleting/Solution.java

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

33
// #Medium #Array #String #Sorting #Two_Pointers
4-
// #2022_03_20_Time_10_ms_(97.43%)_Space_42.5_MB_(96.45%)
4+
// #2022_07_28_Time_19_ms_(89.67%)_Space_51.3_MB_(53.71%)
55

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

‎src/main/java/g0501_0600/s0525_contiguous_array/Solution.java

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

3-
// #Medium #Array #Hash_Table #Prefix_Sum #2022_03_20_Time_17_ms_(92.02%)_Space_51.3_MB_(88.87%)
3+
// #Medium #Array #Hash_Table #Prefix_Sum #2022_07_28_Time_31_ms_(80.05%)_Space_77.6_MB_(61.34%)
44

55
import java.util.HashMap;
66

‎src/main/java/g0501_0600/s0526_beautiful_arrangement/Solution.java

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

33
// #Medium #Array #Dynamic_Programming #Bit_Manipulation #Backtracking #Bitmask
4-
// #2022_03_20_Time_3_ms_(98.99%)_Space_41.5_MB_(26.41%)
4+
// #2022_07_28_Time_3_ms_(98.66%)_Space_41.5_MB_(24.19%)
55

66
public class Solution {
77
public int countArrangement(int n) {

‎src/main/java/g0501_0600/s0528_random_pick_with_weight/Solution.java

Lines changed: 7 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0501_0600.s0528_random_pick_with_weight;
22

33
// #Medium #Math #Binary_Search #Prefix_Sum #Randomized #Binary_Search_II_Day_13
4-
// #2022_03_18_Time_29_ms_(83.26%)_Space_46.5_MB_(94.36%)
4+
// #2022_07_28_Time_42_ms_(50.90%)_Space_60.1_MB_(13.48%)
55

66
import java.util.Comparator;
77
import java.util.Objects;
@@ -29,3 +29,9 @@ public int pickIndex() {
2929
return Objects.requireNonNull(treeSet.ceiling(new int[] {target, 1}))[1];
3030
}
3131
}
32+
33+
/*
34+
* Your Solution object will be instantiated and called as such:
35+
* Solution obj = new Solution(w);
36+
* int param_1 = obj.pickIndex();
37+
*/

‎src/main/java/g0501_0600/s0529_minesweeper/Solution.java

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

33
// #Medium #Array #Depth_First_Search #Breadth_First_Search #Matrix
4-
// #2022_03_20_Time_0_ms_(100.00%)_Space_42.1_MB_(93.35%)
4+
// #2022_07_28_Time_0_ms_(100.00%)_Space_42.6_MB_(85.88%)
55

66
public class Solution {
77
private static final int[][] DIRECTION = {

‎src/main/java/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.java

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

33
// #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
4-
// #2022_03_20_Time_0_ms_(100.00%)_Space_45.1_MB_(48.71%)
4+
// #2022_07_28_Time_1_ms_(92.05%)_Space_45_MB_(70.03%)
55

66
import com_github_leetcode.TreeNode;
77

‎src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array/Solution.java

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

33
// #Medium #Array #Hash_Table #Sorting #Binary_Search #Two_Pointers #Udemy_Arrays
4-
// #2022_03_20_Time_14_ms_(49.69%)_Space_49.5_MB_(15.19%)
4+
// #2022_07_28_Time_13_ms_(58.23%)_Space_48.7_MB_(27.94%)
55

66
import java.util.HashSet;
77

0 commit comments

Comments
 (0)