Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commitbe4b775

Browse files
authored
Updated exec time 1103-1154
1 parent8af2e92 commitbe4b775

File tree

32 files changed

+44
-37
lines changed

32 files changed

+44
-37
lines changed

‎src/main/java/g1101_1200/s1103_distribute_candies_to_people/Solution.java

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

3-
// #Easy #Math #Simulation #2022_02_28_Time_2_ms_(49.07%)_Space_41.9_MB_(19.20%)
3+
// #Easy #Math #Simulation #2023_06_01_Time_1_ms_(97.48%)_Space_40.8_MB_(8.63%)
44

55
publicclassSolution {
66
publicint[]distributeCandies(intcandies,intnumPeople) {

‎src/main/java/g1101_1200/s1104_path_in_zigzag_labelled_binary_tree/Solution.java

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

3-
// #Medium #Math #Tree #Binary_Tree #2022_02_28_Time_1_ms_(58.50%)_Space_41.6_MB_(28.60%)
3+
// #Medium #Math #Tree #Binary_Tree #2023_06_01_Time_0_ms_(100.00%)_Space_40.1_MB_(82.91%)
44

55
importjava.util.LinkedList;
66
importjava.util.List;

‎src/main/java/g1101_1200/s1105_filling_bookcase_shelves/Solution.java

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

3-
// #Medium #Array #Dynamic_Programming #2022_02_28_Time_4_ms_(23.85%)_Space_42.7_MB_(31.80%)
3+
// #Medium #Array #Dynamic_Programming #2023_06_01_Time_3_ms_(21.25%)_Space_41.2_MB_(94.90%)
44

55
importjava.util.Arrays;
66

‎src/main/java/g1101_1200/s1106_parsing_a_boolean_expression/Solution.java

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

3-
// #Hard #String #Stack #Recursion #2022_02_28_Time_3_ms_(93.78%)_Space_42_MB_(70.54%)
3+
// #Hard #String #Stack #Recursion #2023_06_01_Time_6_ms_(78.72%)_Space_43.7_MB_(14.89%)
44

55
importjava.util.ArrayList;
66
importjava.util.List;

‎src/main/java/g1101_1200/s1108_defanging_an_ip_address/Solution.java

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

3-
// #Easy #String #2022_02_28_Time_0_ms_(100.00%)_Space_42.6_MB_(5.79%)
3+
// #Easy #String #2023_06_01_Time_0_ms_(100.00%)_Space_40.6_MB_(55.94%)
44

55
publicclassSolution {
66
publicStringdefangIPaddr(Stringaddress) {

‎src/main/java/g1101_1200/s1109_corporate_flight_bookings/Solution.java

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

3-
// #Medium #Array #Prefix_Sum #2022_03_01_Time_3_ms_(87.75%)_Space_81.6_MB_(55.26%)
3+
// #Medium #Array #Prefix_Sum #2023_06_01_Time_2_ms_(100.00%)_Space_55.6_MB_(95.36%)
44

55
publicclassSolution {
66
publicint[]corpFlightBookings(int[][]bookings,intn) {

‎src/main/java/g1101_1200/s1110_delete_nodes_and_return_forest/Solution.java

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

33
// #Medium #Depth_First_Search #Tree #Binary_Tree
4-
// #2022_07_10_Time_2_ms_(87.37%)_Space_43.3_MB_(83.55%)
4+
// #2023_06_01_Time_1_ms_(98.05%)_Space_44.2_MB_(11.97%)
55

66
importcom_github_leetcode.TreeNode;
77
importjava.util.ArrayList;

‎src/main/java/g1101_1200/s1111_maximum_nesting_depth_of_two_valid_parentheses_strings/Solution.java

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

3-
// #Medium #String #Stack #2022_03_01_Time_1_ms_(99.73%)_Space_44.5_MB_(26.26%)
3+
// #Medium #String #Stack #2023_06_01_Time_1_ms_(100.00%)_Space_43.8_MB_(23.00%)
44

55
publicclassSolution {
66
publicint[]maxDepthAfterSplit(Stringseq) {

‎src/main/java/g1101_1200/s1114_print_in_order/Foo.java

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

3-
// #Easy #Concurrency #2022_03_08_Time_16_ms_(77.21%)_Space_42.4_MB_(49.45%)
3+
// #Easy #Concurrency #2023_06_01_Time_12_ms_(58.10%)_Space_41.7_MB_(65.01%)
44

55
publicclassFoo {
66
privatevolatilebooleanfirstFinished;

‎src/main/java/g1101_1200/s1115_print_foobar_alternately/FooBar.java

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

3-
// #Medium #Concurrency #2022_03_08_Time_16_ms_(90.05%)_Space_42.4_MB_(58.80%)
3+
// #Medium #Concurrency #2023_06_01_Time_24_ms_(38.82%)_Space_43.5_MB_(7.54%)
44

55
importjava.util.concurrent.Semaphore;
66

‎src/main/java/g1101_1200/s1116_print_zero_even_odd/ZeroEvenOdd.java

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

3-
// #Medium #Concurrency #2022_03_09_Time_5_ms_(99.83%)_Space_41_MB_(63.68%)
3+
// #Medium #Concurrency #2023_06_01_Time_7_ms_(38.76%)_Space_42_MB_(38.97%)
44

55
importjava.util.concurrent.Semaphore;
66
importjava.util.function.IntConsumer;

‎src/main/java/g1101_1200/s1117_building_h2o/H2O.java

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

3-
// #Medium #Concurrency #2022_03_09_Time_12_ms_(93.81%)_Space_42.9_MB_(89.01%)
3+
// #Medium #Concurrency #2023_06_01_Time_19_ms_(89.19%)_Space_45.9_MB_(7.13%)
44

55
importjava.util.concurrent.Semaphore;
66

‎src/main/java/g1101_1200/s1122_relative_sort_array/Solution.java

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

33
// #Easy #Array #Hash_Table #Sorting #Counting_Sort
4-
// #2022_03_09_Time_0_ms_(100.00%)_Space_42.7_MB_(39.18%)
4+
// #2023_06_01_Time_0_ms_(100.00%)_Space_41.4_MB_(83.65%)
55

66
publicclassSolution {
77
publicint[]relativeSortArray(int[]arr1,int[]arr2) {

‎src/main/java/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves/Solution.java

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

33
// #Medium #Hash_Table #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
4-
// #2022_03_09_Time_1_ms_(76.02%)_Space_44.2_MB_(44.41%)
4+
// #2023_06_01_Time_0_ms_(100.00%)_Space_43.4_MB_(8.40%)
55

66
importcom_github_leetcode.TreeNode;
77

‎src/main/java/g1101_1200/s1124_longest_well_performing_interval/Solution.java

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

33
// #Medium #Array #Hash_Table #Stack #Prefix_Sum #Monotonic_Stack
4-
// #2022_03_09_Time_13_ms_(71.38%)_Space_54_MB_(37.10%)
4+
// #2023_06_01_Time_13_ms_(59.62%)_Space_44.5_MB_(22.12%)
55

66
importjava.util.HashMap;
77

‎src/main/java/g1101_1200/s1125_smallest_sufficient_team/Solution.java

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

33
// #Hard #Array #Dynamic_Programming #Bit_Manipulation #Bitmask
4-
// #2022_03_09_Time_3_ms_(98.82%)_Space_42.6_MB_(81.66%)
4+
// #2023_06_01_Time_3_ms_(98.50%)_Space_41.4_MB_(87.22%)
55

66
importjava.util.ArrayList;
77
importjava.util.HashMap;

‎src/main/java/g1101_1200/s1128_number_of_equivalent_domino_pairs/Solution.java

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

3-
// #Easy #Array #Hash_Table #Counting #2022_03_09_Time_10_ms_(69.88%)_Space_51.4_MB_(88.61%)
3+
// #Easy #Array #Hash_Table #Counting #2023_06_01_Time_15_ms_(51.49%)_Space_55_MB_(20.00%)
44

55
importjava.util.HashMap;
66
importjava.util.Map;

‎src/main/java/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.java

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

33
// #Medium #Breadth_First_Search #Graph #Graph_Theory_I_Day_10_Standard_Traversal
4-
// #2022_03_09_Time_5_ms_(90.28%)_Space_48.2_MB_(35.18%)
4+
// #2023_06_01_Time_4_ms_(96.63%)_Space_44.3_MB_(10.59%)
55

66
importjava.util.ArrayList;
77
importjava.util.Arrays;

‎src/main/java/g1101_1200/s1130_minimum_cost_tree_from_leaf_values/Solution.java

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

33
// #Medium #Dynamic_Programming #Greedy #Stack #Monotonic_Stack
4-
// #2022_03_09_Time_2_ms_(82.90%)_Space_41.9_MB_(34.83%)
4+
// #2023_06_01_Time_1_ms_(98.05%)_Space_40.4_MB_(69.65%)
55

66
importjava.util.ArrayDeque;
77
importjava.util.Deque;

‎src/main/java/g1101_1200/s1131_maximum_of_absolute_value_expression/Solution.java

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

3-
// #Medium #Array #Math #2022_03_09_Time_8_ms_(60.95%)_Space_49.5_MB_(87.57%)
3+
// #Medium #Array #Math #2023_06_01_Time_13_ms_(24.81%)_Space_52.7_MB_(5.43%)
44

55
publicclassSolution {
66
publicintmaxAbsValExpr(int[]arr1,int[]arr2) {

‎src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java

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

33
// #Easy #Dynamic_Programming #Math #Memoization #Dynamic_Programming_I_Day_1
4-
// #2022_03_09_Time_0_ms_(100.00%)_Space_41.3_MB_(10.42%)
4+
// #2023_06_01_Time_0_ms_(100.00%)_Space_39.6_MB_(48.37%)
55

66
publicclassSolution {
77
publicinttribonacci(intn) {

‎src/main/java/g1101_1200/s1138_alphabet_board_path/Solution.java

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

3-
// #Medium #String #Hash_Table #2022_03_09_Time_1_ms_(76.10%)_Space_42.1_MB_(37.65%)
3+
// #Medium #String #Hash_Table #2023_06_01_Time_1_ms_(48.92%)_Space_40.5_MB_(86.56%)
44

55
publicclassSolution {
66
publicStringalphabetBoardPath(Stringtarget) {

‎src/main/java/g1101_1200/s1139_largest_1_bordered_square/Solution.java

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

3-
// #Medium #Array #Dynamic_Programming #Matrix #2022_03_05_Time_8_ms_(53.28%)_Space_48.1_MB_(29.34%)
3+
// #Medium #Array #Dynamic_Programming #Matrix #2023_06_01_Time_4_ms_(88.04%)_Space_44.7_MB_(17.39%)
44

55
publicclassSolution {
66
publicintlargest1BorderedSquare(int[][]grid) {

‎src/main/java/g1101_1200/s1140_stone_game_ii/Solution.java

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

33
// #Medium #Array #Dynamic_Programming #Math #Game_Theory
4-
// #2022_05_05_Time_12_ms_(44.22%)_Space_46.7_MB_(21.97%)
4+
// #2023_06_01_Time_9_ms_(43.08%)_Space_43_MB_(39.09%)
55

66
importjava.util.Arrays;
77

Lines changed: 5 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
# Write your MySQL query statement below
22
# #Easy #LeetCode_Curated_SQL_70 #Database #SQL_I_Day_7_Function
3-
# #2022_05_24_Time_543_ms_(29.24%)_Space_0B_(100.00%)
4-
select activity_dateas"day",count(distinct user_id)as active_users
5-
from Activity
6-
where activity_date between'2019-06-28'and'2019-07-27'
7-
group by"day"
8-
havingcount(activity_type)>0;
3+
# #2023_06_01_Time_849_ms_(72.54%)_Space_0B_(100.00%)
4+
SELECT activity_dateas"day",COUNT(DISTINCT user_id)AS active_users
5+
FROM activity
6+
WHERE (activity_date>'2019-06-27'AND activity_date<='2019-07-27')
7+
GROUP BY activity_date;

‎src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java

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

33
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
44
// #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19
5-
// #Udemy_Dynamic_Programming #2022_03_05_Time_9_ms_(93.92%)_Space_45.8_MB_(56.55%)
5+
// #Udemy_Dynamic_Programming #2023_06_01_Time_33_ms_(46.23%)_Space_48.2_MB_(90.63%)
66

77
publicclassSolution {
88
publicintlongestCommonSubsequence(Stringtext1,Stringtext2) {

‎src/main/java/g1101_1200/s1144_decrease_elements_to_make_array_zigzag/Solution.java

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

3-
// #Medium #Array #Greedy #2022_03_05_Time_0_ms_(100.00%)_Space_39.8_MB_(54.76%)
3+
// #Medium #Array #Greedy #2023_06_01_Time_0_ms_(100.00%)_Space_40.2_MB_(45.78%)
44

55
publicclassSolution {
66
publicintmovesToMakeZigzag(int[]nums) {

‎src/main/java/g1101_1200/s1145_binary_tree_coloring_game/Solution.java

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

33
// #Medium #Depth_First_Search #Tree #Binary_Tree
4-
// #2022_03_05_Time_0_ms_(100.00%)_Space_42.3_MB_(11.83%)
4+
// #2023_06_01_Time_0_ms_(100.00%)_Space_40.8_MB_(31.34%)
55

66
importcom_github_leetcode.TreeNode;
77

‎src/main/java/g1101_1200/s1146_snapshot_array/SnapshotArray.java

Lines changed: 9 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg1101_1200.s1146_snapshot_array;
22

33
// #Medium #Array #Hash_Table #Binary_Search #Design #Binary_Search_II_Day_18
4-
// #2022_03_05_Time_37_ms_(87.93%)_Space_75.2_MB_(81.59%)
4+
// #2023_06_01_Time_68_ms_(45.86%)_Space_78.9_MB_(59.57%)
55

66
importjava.util.HashMap;
77
importjava.util.Map;
@@ -45,3 +45,11 @@ public int get(int index, int snapId) {
4545
returnar[index];
4646
}
4747
}
48+
49+
/*
50+
* Your SnapshotArray object will be instantiated and called as such:
51+
* SnapshotArray obj = new SnapshotArray(length);
52+
* obj.set(index,val);
53+
* int param_2 = obj.snap();
54+
* int param_3 = obj.get(index,snap_id);
55+
*/

‎src/main/java/g1101_1200/s1147_longest_chunked_palindrome_decomposition/Solution.java

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

33
// #Hard #String #Dynamic_Programming #Greedy #Two_Pointers #Hash_Function #Rolling_Hash
4-
// #2022_03_05_Time_11_ms_(44.95%)_Space_42.8_MB_(60.55%)
4+
// #2023_06_01_Time_2_ms_(60.00%)_Space_43.4_MB_(20.00%)
55

66
publicclassSolution {
77
publicintlongestDecomposition(Stringtext) {
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
11
# Write your MySQL query statement below
22
# #Easy #LeetCode_Curated_SQL_70 #Database #SQL_I_Day_5_Union
3-
# #2022_04_15_Time_459_ms_(44.85%)_Space_0B_(100.00%)
3+
# #2023_06_01_Time_783_ms_(64.09%)_Space_0B_(100.00%)
44
select distinct author_idas idfrom Viewswhere author_id= viewer_idorder by author_id;

‎src/main/java/g1101_1200/s1154_day_of_the_year/Solution.java

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

3-
// #Easy #String #Math #2022_03_05_Time_9_ms_(95.40%)_Space_42.2_MB_(90.80%)
3+
// #Easy #String #Math #2023_06_01_Time_15_ms_(31.55%)_Space_44.4_MB_(22.53%)
44

55
publicclassSolution {
66
publicintdayOfYear(Stringdate) {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp