Skip to content

Commit b5620a0

Browse files
javadevjavadev
authored
Updated exec time 483-496.
1 parent c31d581 commit b5620a0

File tree

11 files changed

+20
-21
lines changed

11 files changed

+20
-21
lines changed

‎README.md‎

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -880,7 +880,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
880880
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
881881
|-|-|-|-|-|-
882882
| 0589 |[N-ary Tree Preorder Traversal](src/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack | 2 | 54.35
883-
| 0496 |[Next Greater Element I](src/main/java/g0401_0500/s0496_next_greater_element_i/Solution.java)| Easy | Array, Hash_Table, Stack, Monotonic_Stack | 3 | 84.97
883+
| 0496 |[Next Greater Element I](src/main/java/g0401_0500/s0496_next_greater_element_i/Solution.java)| Easy | Array, Hash_Table, Stack, Monotonic_Stack | 4 | 81.18
884884
| 1232 |[Check If It Is a Straight Line](src/main/java/g1201_1300/s1232_check_if_it_is_a_straight_line/Solution.java)| Easy | Array, Math, Geometry | 0 | 100.00
885885

886886
#### Day 6 Array
@@ -3292,16 +3292,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
32923292
| 0500 |[Keyboard Row](src/main/java/g0401_0500/s0500_keyboard_row/Solution.java)| Easy | Array, String, Hash_Table | 0 | 100.00
32933293
| 0498 |[Diagonal Traverse](src/main/java/g0401_0500/s0498_diagonal_traverse/Solution.java)| Medium | Array, Matrix, Simulation | 2 | 96.07
32943294
| 0497 |[Random Point in Non-overlapping Rectangles](src/main/java/g0401_0500/s0497_random_point_in_non_overlapping_rectangles/Solution.java)| Medium | Math, Binary_Search, Prefix_Sum, Ordered_Set, Randomized, Reservoir_Sampling | 44 | 97.50
3295-
| 0496 |[Next Greater Element I](src/main/java/g0401_0500/s0496_next_greater_element_i/Solution.java)| Easy | Array, Hash_Table, Stack, Monotonic_Stack, Programming_Skills_I_Day_5_Function | 3 | 84.97
3296-
| 0495 |[Teemo Attacking](src/main/java/g0401_0500/s0495_teemo_attacking/Solution.java)| Easy | Array, Simulation | 4 | 26.85
3297-
| 0494 |[Target Sum](src/main/java/g0401_0500/s0494_target_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Backtracking | 10 | 82.41
3298-
| 0493 |[Reverse Pairs](src/main/java/g0401_0500/s0493_reverse_pairs/Solution.java)| Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 121 | 31.13
3299-
| 0492 |[Construct the Rectangle](src/main/java/g0401_0500/s0492_construct_the_rectangle/Solution.java)| Easy | Math | 1 | 74.25
3300-
| 0491 |[Increasing Subsequences](src/main/java/g0401_0500/s0491_increasing_subsequences/Solution.java)| Medium | Array, Hash_Table, Bit_Manipulation, Backtracking | 22 | 46.38
3301-
| 0488 |[Zuma Game](src/main/java/g0401_0500/s0488_zuma_game/Solution.java)| Hard | String, Dynamic_Programming, Breadth_First_Search, Memoization | 1989 | 32.79
3302-
| 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
3295+
| 0496 |[Next Greater Element I](src/main/java/g0401_0500/s0496_next_greater_element_i/Solution.java)| Easy | Array, Hash_Table, Stack, Monotonic_Stack, Programming_Skills_I_Day_5_Function | 4 | 81.18
3296+
| 0495 |[Teemo Attacking](src/main/java/g0401_0500/s0495_teemo_attacking/Solution.java)| Easy | Array, Simulation | 2 | 97.97
3297+
| 0494 |[Target Sum](src/main/java/g0401_0500/s0494_target_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Backtracking | 9 | 79.99
3298+
| 0493 |[Reverse Pairs](src/main/java/g0401_0500/s0493_reverse_pairs/Solution.java)| Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 92 | 52.08
3299+
| 0492 |[Construct the Rectangle](src/main/java/g0401_0500/s0492_construct_the_rectangle/Solution.java)| Easy | Math | 1 | 74.88
3300+
| 0491 |[Increasing Subsequences](src/main/java/g0401_0500/s0491_increasing_subsequences/Solution.java)| Medium | Array, Hash_Table, Bit_Manipulation, Backtracking | 24 | 38.30
3301+
| 0488 |[Zuma Game](src/main/java/g0401_0500/s0488_zuma_game/Solution.java)| Hard | String, Dynamic_Programming, Breadth_First_Search, Memoization | 1593 | 37.71
3302+
| 0486 |[Predict the Winner](src/main/java/g0401_0500/s0486_predict_the_winner/Solution.java)| Medium | Array, Dynamic_Programming, Math, Recursion, Game_Theory | 1 | 85.17
33033303
| 0485 |[Max Consecutive Ones](src/main/java/g0401_0500/s0485_max_consecutive_ones/Solution.java)| Easy | Array | 1 | 100.00
3304-
| 0483 |[Smallest Good Base](src/main/java/g0401_0500/s0483_smallest_good_base/Solution.java)| Hard | Math, Binary_Search | 3 | 87.88
3304+
| 0483 |[Smallest Good Base](src/main/java/g0401_0500/s0483_smallest_good_base/Solution.java)| Hard | Math, Binary_Search | 2 | 96.00
33053305
| 0482 |[License Key Formatting](src/main/java/g0401_0500/s0482_license_key_formatting/Solution.java)| Easy | String | 8 | 96.52
33063306
| 0481 |[Magical String](src/main/java/g0401_0500/s0481_magical_string/Solution.java)| Medium | String, Two_Pointers | 5 | 93.33
33073307
| 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

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

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

3-
// #Hard #Math #Binary_Search #2022_03_18_Time_3_ms_(87.88%)_Space_42.7_MB_(30.30%)
3+
// #Hard #Math #Binary_Search #2022_07_21_Time_2_ms_(96.00%)_Space_40.6_MB_(93.33%)
44

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

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

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

3-
// #Easy #Array #2022_03_18_Time_1_ms_(100.00%)_Space_43.4_MB_(81.08%)
3+
// #Easy #Array #2022_07_21_Time_1_ms_(100.00%)_Space_43.6_MB_(84.46%)
44

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

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

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

33
// #Medium #Array #Dynamic_Programming #Math #Recursion #Game_Theory
4-
// #2022_03_18_Time_0_ms_(100.00%)_Space_39.6_MB_(74.06%)
4+
// #2022_07_21_Time_1_ms_(85.17%)_Space_42_MB_(17.19%)
55

66
@SuppressWarnings("java:S3012")
77
public class Solution {

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

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

33
// #Hard #String #Dynamic_Programming #Breadth_First_Search #Memoization
4-
// #2022_07_13_Time_1989_ms_(32.79%)_Space_56.5_MB_(81.97%)
4+
// #2022_07_21_Time_1593_ms_(37.71%)_Space_234.5_MB_(13.12%)
55

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

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

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

33
// #Medium #Array #Hash_Table #Bit_Manipulation #Backtracking
4-
// #2022_03_19_Time_22_ms_(46.38%)_Space_68.4_MB_(64.59%)
4+
// #2022_07_21_Time_24_ms_(38.30%)_Space_68.7_MB_(63.52%)
55

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

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

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

3-
// #Easy #Math #2022_03_19_Time_1_ms_(74.25%)_Space_41.9_MB_(17.67%)
3+
// #Easy #Math #2022_07_21_Time_1_ms_(74.88%)_Space_42_MB_(8.37%)
44

55
public class Solution {
66
/*

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

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

33
// #Hard #Array #Binary_Search #Ordered_Set #Divide_and_Conquer #Segment_Tree #Binary_Indexed_Tree
4-
// #Merge_Sort #2022_03_19_Time_121_ms_(31.13%)_Space_71.5_MB_(67.86%)
4+
// #Merge_Sort #2022_07_21_Time_92_ms_(52.08%)_Space_75.2_MB_(43.96%)
55

66
import java.util.Arrays;
77

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

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

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Backtracking
4-
// #2022_03_19_Time_10_ms_(82.41%)_Space_44.5_MB_(37.47%)
4+
// #2022_07_21_Time_9_ms_(79.99%)_Space_45.2_MB_(32.79%)
55

66
public class Solution {
77
public int findTargetSumWays(int[] nums, int s) {
@@ -14,7 +14,6 @@ public int findTargetSumWays(int[] nums, int s) {
1414
if (s > sum || (sum + s) % 2 != 0) {
1515
return 0;
1616
}
17-
1817
int[][] dp = new int[(sum + s) / 2 + 1][nums.length + 1];
1918
dp[0][0] = 1;
2019
// empty knapsack must be processed specially

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

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

3-
// #Easy #Array #Simulation #2022_03_19_Time_4_ms_(26.85%)_Space_53.7_MB_(50.49%)
3+
// #Easy #Array #Simulation #2022_07_21_Time_2_ms_(97.97%)_Space_55_MB_(14.20%)
44

55
public class Solution {
66
public int findPoisonedDuration(int[] timeSeries, int duration) {

0 commit comments

Comments
 (0)