Skip to content

Commit c10d9b2

Browse files
javadevjavadev
authored
Updated exec time 472-482.
1 parent 0d138a3 commit c10d9b2

File tree

12 files changed

+27
-21
lines changed

12 files changed

+27
-21
lines changed

‎README.md‎

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -3302,17 +3302,17 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
33023302
| 0486 |[Predict the Winner](src/main/java/g0401_0500/s0486_predict_the_winner/Solution.java)| Medium | Array, Dynamic_Programming, Math, Recursion, Game_Theory | 0 | 100.00
33033303
| 0485 |[Max Consecutive Ones](src/main/java/g0401_0500/s0485_max_consecutive_ones/Solution.java)| Easy | Array | 1 | 100.00
33043304
| 0483 |[Smallest Good Base](src/main/java/g0401_0500/s0483_smallest_good_base/Solution.java)| Hard | Math, Binary_Search | 3 | 87.88
3305-
| 0482 |[License Key Formatting](src/main/java/g0401_0500/s0482_license_key_formatting/Solution.java)| Easy | String | 7 | 98.60
3306-
| 0481 |[Magical String](src/main/java/g0401_0500/s0481_magical_string/Solution.java)| Medium | String, Two_Pointers | 5 | 88.46
3307-
| 0480 |[Sliding Window Median](src/main/java/g0401_0500/s0480_sliding_window_median/Solution.java)| Hard | Array, Hash_Table, Heap_Priority_Queue, Sliding_Window | 46 | 80.65
3308-
| 0479 |[Largest Palindrome Product](src/main/java/g0401_0500/s0479_largest_palindrome_product/Solution.java)| Hard | Math | 6 | 97.54
3309-
| 0478 |[Generate Random Point in a Circle](src/main/java/g0401_0500/s0478_generate_random_point_in_a_circle/Solution.java)| Medium | Math, Geometry, Randomized, Rejection_Sampling | 196 | 98.10
3310-
| 0477 |[Total Hamming Distance](src/main/java/g0401_0500/s0477_total_hamming_distance/Solution.java)| Medium | Array, Math, Bit_Manipulation | 5 | 90.97
3305+
| 0482 |[License Key Formatting](src/main/java/g0401_0500/s0482_license_key_formatting/Solution.java)| Easy | String | 8 | 96.52
3306+
| 0481 |[Magical String](src/main/java/g0401_0500/s0481_magical_string/Solution.java)| Medium | String, Two_Pointers | 5 | 93.33
3307+
| 0480 |[Sliding Window Median](src/main/java/g0401_0500/s0480_sliding_window_median/Solution.java)| Hard | Array, Hash_Table, Heap_Priority_Queue, Sliding_Window | 60 | 70.77
3308+
| 0479 |[Largest Palindrome Product](src/main/java/g0401_0500/s0479_largest_palindrome_product/Solution.java)| Hard | Math | 6 | 87.50
3309+
| 0478 |[Generate Random Point in a Circle](src/main/java/g0401_0500/s0478_generate_random_point_in_a_circle/Solution.java)| Medium | Math, Geometry, Randomized, Rejection_Sampling | 342 | 56.21
3310+
| 0477 |[Total Hamming Distance](src/main/java/g0401_0500/s0477_total_hamming_distance/Solution.java)| Medium | Array, Math, Bit_Manipulation | 5 | 95.10
33113311
| 0476 |[Number Complement](src/main/java/g0401_0500/s0476_number_complement/Solution.java)| Easy | Bit_Manipulation | 0 | 100.00
3312-
| 0475 |[Heaters](src/main/java/g0401_0500/s0475_heaters/Solution.java)| Medium | Array, Sorting, Binary_Search, Two_Pointers | 8 | 99.30
3313-
| 0474 |[Ones and Zeroes](src/main/java/g0401_0500/s0474_ones_and_zeroes/Solution.java)| Medium | Array, String, Dynamic_Programming | 41 | 68.79
3314-
| 0473 |[Matchsticks to Square](src/main/java/g0401_0500/s0473_matchsticks_to_square/Solution.java)| Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 161 | 55.12
3315-
| 0472 |[Concatenated Words](src/main/java/g0401_0500/s0472_concatenated_words/Solution.java)| Hard | Array, String, Dynamic_Programming, Depth_First_Search, Trie | 84 | 79.03
3312+
| 0475 |[Heaters](src/main/java/g0401_0500/s0475_heaters/Solution.java)| Medium | Array, Sorting, Binary_Search, Two_Pointers | 9 | 99.61
3313+
| 0474 |[Ones and Zeroes](src/main/java/g0401_0500/s0474_ones_and_zeroes/Solution.java)| Medium | Array, String, Dynamic_Programming | 41 | 60.42
3314+
| 0473 |[Matchsticks to Square](src/main/java/g0401_0500/s0473_matchsticks_to_square/Solution.java)| Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 165 | 53.96
3315+
| 0472 |[Concatenated Words](src/main/java/g0401_0500/s0472_concatenated_words/Solution.java)| Hard | Array, String, Dynamic_Programming, Depth_First_Search, Trie | 84 | 74.09
33163316
| 0470 |[Implement Rand10() Using Rand7()](src/main/java/g0401_0500/s0470_implement_rand10_using_rand7/Solution.java)| Medium | Math, Randomized, Probability_and_Statistics, Rejection_Sampling | 8 | 82.15
33173317
| 0468 |[Validate IP Address](src/main/java/g0401_0500/s0468_validate_ip_address/Solution.java)| Medium | String | 2 | 73.87
33183318
| 0467 |[Unique Substrings in Wraparound String](src/main/java/g0401_0500/s0467_unique_substrings_in_wraparound_string/Solution.java)| Medium | String, Dynamic_Programming | 4 | 98.79

‎src/main/java/g0401_0500/s0472_concatenated_words/Solution.java‎

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

33
// #Hard #Array #String #Dynamic_Programming #Depth_First_Search #Trie
4-
// #2022_03_18_Time_84_ms_(79.03%)_Space_81.6_MB_(50.56%)
4+
// #2022_07_20_Time_84_ms_(74.09%)_Space_82_MB_(34.63%)
55

66
import java.util.ArrayList;
77
import java.util.Arrays;

‎src/main/java/g0401_0500/s0473_matchsticks_to_square/Solution.java‎

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

33
// #Medium #Array #Dynamic_Programming #Bit_Manipulation #Backtracking #Bitmask
4-
// #2022_07_14_Time_161_ms_(55.12%)_Space_40.4_MB_(88.85%)
4+
// #2022_07_20_Time_165_ms_(53.96%)_Space_41.8_MB_(64.07%)
55

66
import java.util.Arrays;
77

‎src/main/java/g0401_0500/s0474_ones_and_zeroes/Solution.java‎

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

33
// #Medium #Array #String #Dynamic_Programming
4-
// #2022_03_18_Time_41_ms_(68.79%)_Space_42.7_MB_(67.67%)
4+
// #2022_07_20_Time_41_ms_(60.42%)_Space_42.5_MB_(73.29%)
55

66
public class Solution {
77
/*

‎src/main/java/g0401_0500/s0475_heaters/Solution.java‎

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

33
// #Medium #Array #Sorting #Binary_Search #Two_Pointers
4-
// #2022_03_18_Time_8_ms_(99.30%)_Space_44.2_MB_(90.36%)
4+
// #2022_07_20_Time_9_ms_(99.61%)_Space_44.9_MB_(84.55%)
55

66
import java.util.Arrays;
77

‎src/main/java/g0401_0500/s0476_number_complement/Solution.java‎

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

3-
// #Easy #Bit_Manipulation #2022_03_18_Time_0_ms_(100.00%)_Space_41.7_MB_(9.65%)
3+
// #Easy #Bit_Manipulation #2022_07_20_Time_0_ms_(100.00%)_Space_40.7_MB_(65.79%)
44

55
public class Solution {
66
public int findComplement(int num) {

‎src/main/java/g0401_0500/s0477_total_hamming_distance/Solution.java‎

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

3-
// #Medium #Array #Math #Bit_Manipulation #2022_03_18_Time_5_ms_(90.97%)_Space_53.9_MB_(55.17%)
3+
// #Medium #Array #Math #Bit_Manipulation #2022_07_20_Time_5_ms_(95.10%)_Space_54.9_MB_(8.69%)
44

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

‎src/main/java/g0401_0500/s0478_generate_random_point_in_a_circle/Solution.java‎

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

33
// #Medium #Math #Geometry #Randomized #Rejection_Sampling
4-
// #2022_03_18_Time_196_ms_(98.10%)_Space_51.3_MB_(87.97%)
4+
// #2022_07_20_Time_342_ms_(56.21%)_Space_128_MB_(45.56%)
55

66
import java.util.Random;
77

@@ -36,3 +36,9 @@ private double getCoordinate(double center) {
3636
return center - radius + random.nextDouble() * 2 * radius;
3737
}
3838
}
39+
40+
/*
41+
* Your Solution object will be instantiated and called as such:
42+
* Solution obj = new Solution(radius, x_center, y_center);
43+
* double[] param_1 = obj.randPoint();
44+
*/

‎src/main/java/g0401_0500/s0479_largest_palindrome_product/Solution.java‎

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

3-
// #Hard #Math #2022_03_18_Time_6_ms_(97.54%)_Space_41.3_MB_(66.39%)
3+
// #Hard #Math #2022_07_20_Time_6_ms_(87.50%)_Space_40.5_MB_(78.57%)
44

55
public class Solution {
66
public int largestPalindrome(int n) {

‎src/main/java/g0401_0500/s0480_sliding_window_median/Solution.java‎

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

33
// #Hard #Array #Hash_Table #Heap_Priority_Queue #Sliding_Window
4-
// #2022_03_18_Time_46_ms_(80.65%)_Space_56_MB_(35.54%)
4+
// #2022_07_20_Time_60_ms_(70.77%)_Space_56.3_MB_(17.95%)
55

66
import java.util.Comparator;
77
import java.util.TreeSet;

0 commit comments

Comments
 (0)