Skip to content

Commit a569a76

Browse files
javadevjavadev
authored
Updated exec time 564-586.
1 parent e6cf274 commit a569a76

File tree

12 files changed

+29
-31
lines changed

12 files changed

+29
-31
lines changed

‎README.md‎

Lines changed: 18 additions & 18 deletions
Original file line numberDiff line numberDiff line change
@@ -92,7 +92,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
9292
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
9393
|-|-|-|-|-|-
9494
| 0003 |[Longest Substring Without Repeating Characters](src.save/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 5 | 91.03
95-
| 0567 |[Permutation in String](src.save/main/java/g0501_0600/s0567_permutation_in_string/Solution.java)| Medium | String, Hash_Table, Two_Pointers, Sliding_Window | 4 | 95.23
95+
| 0567 |[Permutation in String](src.save/main/java/g0501_0600/s0567_permutation_in_string/Solution.java)| Medium | String, Hash_Table, Two_Pointers, Sliding_Window | 5 | 93.93
9696

9797
#### Day 7 Breadth-First Search Depth-First Search
9898

@@ -204,7 +204,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
204204
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
205205
|-|-|-|-|-|-
206206
| 0117 |[Populating Next Right Pointers in Each Node II](src.save/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List | 0 | 100.00
207-
| 0572 |[Subtree of Another Tree](src.save/main/java/g0501_0600/s0572_subtree_of_another_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Hash_Function, String_Matching | 0 | 100.00
207+
| 0572 |[Subtree of Another Tree](src.save/main/java/g0501_0600/s0572_subtree_of_another_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Hash_Function, String_Matching | 1 | 100.00
208208

209209
#### Day 8 Breadth First Search Depth First Search
210210

@@ -277,7 +277,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
277277
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
278278
|-|-|-|-|-|-
279279
| 1143 |[Longest Common Subsequence](src.save/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming | 9 | 93.92
280-
| 0583 |[Delete Operation for Two Strings](src.save/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java)| Medium | String, Dynamic_Programming | 12 | 73.04
280+
| 0583 |[Delete Operation for Two Strings](src.save/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java)| Medium | String, Dynamic_Programming | 12 | 79.10
281281

282282
#### Day 18 Dynamic Programming
283283

@@ -739,7 +739,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
739739
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
740740
|-|-|-|-|-|-
741741
| 1572 |[Matrix Diagonal Sum](src.save/main/java/g1501_1600/s1572_matrix_diagonal_sum/Solution.java)| Easy | Array, Matrix | 3 | 10.25
742-
| 0566 |[Reshape the Matrix](src.save/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java)| Easy | Array, Matrix, Simulation | 1 | 84.34
742+
| 0566 |[Reshape the Matrix](src.save/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java)| Easy | Array, Matrix, Simulation | 1 | 90.08
743743

744744
#### Day 8 String
745745

@@ -1037,7 +1037,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
10371037
|-|-|-|-|-|-
10381038
| 0595 |[Big Countries](src.save/main/java/g0501_0600/s0595_big_countries/script.sql)| Easy | Database | 241 | 92.61
10391039
| 1757 |[Recyclable and Low Fat Products](src.save/main/java/g1701_1800/s1757_recyclable_and_low_fat_products/script.sql)| Easy | Database | 475 | 71.54
1040-
| 0584 |[Find Customer Referee](src.save/main/java/g0501_0600/s0584_find_customer_referee/script.sql)| Easy | Database | 505 | 43.87
1040+
| 0584 |[Find Customer Referee](src.save/main/java/g0501_0600/s0584_find_customer_referee/script.sql)| Easy | Database | 531 | 58.63
10411041
| 0183 |[Customers Who Never Order](src.save/main/java/g0101_0200/s0183_customers_who_never_order/script.sql)| Easy | Database | 376 | 98.73
10421042

10431043
#### Day 2 Select and Order
@@ -1092,7 +1092,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
10921092

10931093
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10941094
|-|-|-|-|-|-
1095-
| 0586 |[Customer Placing the Largest Number of Orders](src.save/main/java/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/script.sql)| Easy | LeetCode_Curated_SQL_70, Database | 392 | 90.54
1095+
| 0586 |[Customer Placing the Largest Number of Orders](src.save/main/java/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/script.sql)| Easy | LeetCode_Curated_SQL_70, Database | 484 | 66.42
10961096
| 0511 |[Game Play Analysis I](src.save/main/java/g0501_0600/s0511_game_play_analysis_i/script.sql)| Easy | LeetCode_Curated_SQL_70, Database | 586 | 56.94
10971097
| 1890 |[The Latest Login in 2020](src.save/main/java/g1801_1900/s1890_the_latest_login_in_2020/script.sql)| Easy | Database | 571 | 73.59
10981098
| 1741 |[Find Total Time Spent by Each Employee](src.save/main/java/g1701_1800/s1741_find_total_time_spent_by_each_employee/script.sql)| Easy | Database | 414 | 93.27
@@ -1609,7 +1609,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
16091609

16101610
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
16111611
|-|-|-|-|-|-
1612-
| 0566 |[Reshape the Matrix](src.save/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java)| Easy | Array, Matrix, Simulation | 1 | 84.34
1612+
| 0566 |[Reshape the Matrix](src.save/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java)| Easy | Array, Matrix, Simulation | 1 | 90.08
16131613
| 0118 |[Pascal's Triangle](src.save/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming | 1 | 67.08
16141614

16151615
#### Day 5 Array
@@ -3239,17 +3239,17 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
32393239
| 0590 |[N-ary Tree Postorder Traversal](src.save/main/java/g0501_0600/s0590_n_ary_tree_postorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack | 0 | 100.00
32403240
| 0589 |[N-ary Tree Preorder Traversal](src.save/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack, Programming_Skills_I_Day_5_Function, Level_1_Day_6_Tree | 2 | 54.35
32413241
| 0587 |[Erect the Fence](src.save/main/java/g0501_0600/s0587_erect_the_fence/Solution.java)| Hard | Array, Math, Geometry | 10 | 87.50
3242-
| 0586 |[Customer Placing the Largest Number of Orders](src.save/main/java/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/script.sql)| Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_8_Function | 392 | 90.54
3243-
| 0584 |[Find Customer Referee](src.save/main/java/g0501_0600/s0584_find_customer_referee/script.sql)| Easy | Database, SQL_I_Day_1_Select | 505 | 43.87
3244-
| 0583 |[Delete Operation for Two Strings](src.save/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java)| Medium | String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming | 12 | 73.04
3245-
| 0581 |[Shortest Unsorted Continuous Subarray](src.save/main/java/g0501_0600/s0581_shortest_unsorted_continuous_subarray/Solution.java)| Medium | Array, Sorting, Greedy, Two_Pointers, Stack, Monotonic_Stack | 1 | 98.19
3246-
| 0576 |[Out of Boundary Paths](src.save/main/java/g0501_0600/s0576_out_of_boundary_paths/Solution.java)| Medium | Dynamic_Programming | 7 | 74.13
3247-
| 0575 |[Distribute Candies](src.save/main/java/g0501_0600/s0575_distribute_candies/Solution.java)| Easy | Array, Hash_Table | 64 | 40.90
3248-
| 0572 |[Subtree of Another Tree](src.save/main/java/g0501_0600/s0572_subtree_of_another_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Hash_Function, String_Matching, Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search | 0 | 100.00
3249-
| 0567 |[Permutation in String](src.save/main/java/g0501_0600/s0567_permutation_in_string/Solution.java)| Medium | String, Hash_Table, Two_Pointers, Sliding_Window, Algorithm_I_Day_6_Sliding_Window | 4 | 95.23
3250-
| 0566 |[Reshape the Matrix](src.save/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java)| Easy | Array, Matrix, Simulation, Data_Structure_I_Day_4_Array, Programming_Skills_I_Day_7_Array | 1 | 84.34
3251-
| 0565 |[Array Nesting](src.save/main/java/g0501_0600/s0565_array_nesting/Solution.java)| Medium | Array, Depth_First_Search | 4 | 98.54
3252-
| 0564 |[Find the Closest Palindrome](src.save/main/java/g0501_0600/s0564_find_the_closest_palindrome/Solution.java)| Hard | String, Math | 1 | 100.00
3242+
| 0586 |[Customer Placing the Largest Number of Orders](src.save/main/java/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/script.sql)| Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_8_Function | 484 | 66.42
3243+
| 0584 |[Find Customer Referee](src.save/main/java/g0501_0600/s0584_find_customer_referee/script.sql)| Easy | Database, SQL_I_Day_1_Select | 531 | 58.63
3244+
| 0583 |[Delete Operation for Two Strings](src.save/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java)| Medium | String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming | 12 | 79.10
3245+
| 0581 |[Shortest Unsorted Continuous Subarray](src.save/main/java/g0501_0600/s0581_shortest_unsorted_continuous_subarray/Solution.java)| Medium | Array, Sorting, Greedy, Two_Pointers, Stack, Monotonic_Stack | 2 | 84.72
3246+
| 0576 |[Out of Boundary Paths](src.save/main/java/g0501_0600/s0576_out_of_boundary_paths/Solution.java)| Medium | Dynamic_Programming | 5 | 92.95
3247+
| 0575 |[Distribute Candies](src.save/main/java/g0501_0600/s0575_distribute_candies/Solution.java)| Easy | Array, Hash_Table | 67 | 42.81
3248+
| 0572 |[Subtree of Another Tree](src.save/main/java/g0501_0600/s0572_subtree_of_another_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Hash_Function, String_Matching, Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search | 1 | 100.00
3249+
| 0567 |[Permutation in String](src.save/main/java/g0501_0600/s0567_permutation_in_string/Solution.java)| Medium | String, Hash_Table, Two_Pointers, Sliding_Window, Algorithm_I_Day_6_Sliding_Window | 5 | 93.93
3250+
| 0566 |[Reshape the Matrix](src.save/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java)| Easy | Array, Matrix, Simulation, Data_Structure_I_Day_4_Array, Programming_Skills_I_Day_7_Array | 1 | 90.08
3251+
| 0565 |[Array Nesting](src.save/main/java/g0501_0600/s0565_array_nesting/Solution.java)| Medium | Array, Depth_First_Search | 5 | 95.44
3252+
| 0564 |[Find the Closest Palindrome](src.save/main/java/g0501_0600/s0564_find_the_closest_palindrome/Solution.java)| Hard | String, Math | 2 | 100.00
32533253
| 0563 |[Binary Tree Tilt](src.save/main/java/g0501_0600/s0563_binary_tree_tilt/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree | 1 | 81.35
32543254
| 0561 |[Array Partition I](src.save/main/java/g0501_0600/s0561_array_partition_i/Solution.java)| Easy | Array, Sorting, Greedy, Counting_Sort | 14 | 84.99
32553255
| 0560 |[Subarray Sum Equals K](src.save/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Data_Structure_II_Day_5_Array | 21 | 98.97

‎src.save/main/java/g0501_0600/s0564_find_the_closest_palindrome/Solution.java‎

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

3-
// #Hard #String #Math #2022_03_20_Time_1_ms_(100.00%)_Space_40.4_MB_(87.67%)
3+
// #Hard #String #Math #2022_08_10_Time_2_ms_(100.00%)_Space_42.7_MB_(26.15%)
44

55
@SuppressWarnings("java:S2184")
66
public class Solution {
@@ -22,7 +22,6 @@ public String nearestPalindromic(String n) {
2222
if (first + second == 2 * num) {
2323
return first < second ? String.valueOf(first) : String.valueOf(second);
2424
}
25-
2625
return Math.abs(num - first) > Math.abs(num - second)
2726
? String.valueOf(second)
2827
: String.valueOf(first);
@@ -38,7 +37,6 @@ private long palindromeGenerator(long num, int length) {
3837
} else if (numOfDigits < length) {
3938
return ((long) Math.pow(10, numOfDigits) - 1);
4039
}
41-
4240
num = num - num % (long) Math.pow(10, numOfDigits / 2);
4341
long temp = num;
4442
for (int j = 0; j < numOfDigits / 2; j++) {

‎src.save/main/java/g0501_0600/s0565_array_nesting/Solution.java‎

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

3-
// #Medium #Array #Depth_First_Search #2022_03_20_Time_4_ms_(98.54%)_Space_58.6_MB_(86.40%)
3+
// #Medium #Array #Depth_First_Search #2022_08_10_Time_5_ms_(95.44%)_Space_75.8_MB_(65.97%)
44

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

‎src.save/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java‎

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

33
// #Easy #Array #Matrix #Simulation #Data_Structure_I_Day_4_Array #Programming_Skills_I_Day_7_Array
4-
// #2022_03_20_Time_1_ms_(84.34%)_Space_50_MB_(65.51%)
4+
// #2022_08_10_Time_1_ms_(90.08%)_Space_51.4_MB_(11.21%)
55

66
public class Solution {
77
public int[][] matrixReshape(int[][] mat, int r, int c) {

‎src.save/main/java/g0501_0600/s0567_permutation_in_string/Solution.java‎

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

33
// #Medium #String #Hash_Table #Two_Pointers #Sliding_Window #Algorithm_I_Day_6_Sliding_Window
4-
// #2022_03_20_Time_4_ms_(95.23%)_Space_43.6_MB_(40.52%)
4+
// #2022_08_10_Time_5_ms_(93.93%)_Space_43.1_MB_(71.37%)
55

66
public class Solution {
77
public boolean checkInclusion(String s1, String s2) {

‎src.save/main/java/g0501_0600/s0572_subtree_of_another_tree/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Easy #Depth_First_Search #Tree #Binary_Tree #Hash_Function #String_Matching
44
// #Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search
5-
// #2022_03_20_Time_0_ms_(100.00%)_Space_41.8_MB_(96.46%)
5+
// #2022_08_10_Time_1_ms_(100.00%)_Space_47.2_MB_(13.44%)
66

77
import com_github_leetcode.TreeNode;
88

‎src.save/main/java/g0501_0600/s0575_distribute_candies/Solution.java‎

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

3-
// #Easy #Array #Hash_Table #2022_03_20_Time_64_ms_(40.90%)_Space_105.5_MB_(61.44%)
3+
// #Easy #Array #Hash_Table #2022_08_10_Time_67_ms_(42.81%)_Space_111.2_MB_(25.92%)
44

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

‎src.save/main/java/g0501_0600/s0576_out_of_boundary_paths/Solution.java‎

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

3-
// #Medium #Dynamic_Programming #2022_03_20_Time_7_ms_(74.13%)_Space_42.4_MB_(65.17%)
3+
// #Medium #Dynamic_Programming #2022_08_10_Time_5_ms_(92.95%)_Space_43.1_MB_(36.44%)
44

55
import java.util.Arrays;
66

‎src.save/main/java/g0501_0600/s0581_shortest_unsorted_continuous_subarray/Solution.java‎

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

33
// #Medium #Array #Sorting #Greedy #Two_Pointers #Stack #Monotonic_Stack
4-
// #2022_03_20_Time_1_ms_(98.19%)_Space_42.8_MB_(89.50%)
4+
// #2022_08_10_Time_2_ms_(84.72%)_Space_55_MB_(6.90%)
55

66
public class Solution {
77
public int findUnsortedSubarray(int[] nums) {

‎src.save/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java‎

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

33
// #Medium #String #Dynamic_Programming #Algorithm_II_Day_17_Dynamic_Programming
4-
// #2022_03_20_Time_12_ms_(73.04%)_Space_47.4_MB_(16.18%)
4+
// #2022_08_10_Time_12_ms_(79.10%)_Space_47.4_MB_(14.02%)
55

66
public class Solution {
77
public int minDistance(String word1, String word2) {

0 commit comments

Comments
 (0)