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

Commitdaa839f

Browse files
authored
Updated exec time 101-110.
1 parentd0f44cc commitdaa839f

File tree

11 files changed

+23
-25
lines changed

11 files changed

+23
-25
lines changed

‎README.md‎

Lines changed: 13 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -126,7 +126,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
126126

127127
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
128128
|-|-|-|-|-|-
129-
| 0102 |[Binary Tree Level Order Traversal](src.save/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree |0 |100.00
129+
| 0102 |[Binary Tree Level Order Traversal](src.save/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree |1 |91.09
130130
| 0104 |[Maximum Depth of Binary Tree](src.save/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
131131
| 0101 |[Symmetric Tree](src.save/main/java/g0101_0200/s0101_symmetric_tree/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
132132

@@ -262,8 +262,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
262262
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
263263
|-|-|-|-|-|-
264264
| 0108 |[Convert Sorted Array to Binary Search Tree](src.save/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java)| Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 0 | 100.00
265-
| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src.save/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer |1 |99.69
266-
| 0103 |[Binary Tree Zigzag Level Order Traversal](src.save/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 1 |86.98
265+
| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src.save/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer |3 |86.35
266+
| 0103 |[Binary Tree Zigzag Level Order Traversal](src.save/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 1 |95.00
267267

268268
####Day 16 Tree
269269

@@ -1055,7 +1055,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
10551055

10561056
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
10571057
|-|-|-|-|-|-
1058-
| 0110 |[Balanced Binary Tree](src.save/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree |0 |100.00
1058+
| 0110 |[Balanced Binary Tree](src.save/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree |1 |98.82
10591059
| 0459 |[Repeated Substring Pattern](src.save/main/java/g0401_0500/s0459_repeated_substring_pattern/Solution.java)| Easy | String, String_Matching | 9 | 90.15
10601060

10611061
####Day 3
@@ -1416,7 +1416,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
14161416
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
14171417
|-|-|-|-|-|-
14181418
| 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 | 2 | 54.35
1419-
| 0102 |[Binary Tree Level Order Traversal](src.save/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree |0 |100.00
1419+
| 0102 |[Binary Tree Level Order Traversal](src.save/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree |1 |91.09
14201420

14211421
####Day 7 Binary Search
14221422

@@ -2170,7 +2170,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
21702170
| 1439 |[Find the Kth Smallest Sum of a Matrix With Sorted Rows](src.save/main/java/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/Solution.java)| Hard | Array, Binary_Search, Matrix, Heap_Priority_Queue | 40 | 75.79
21712171
| 1438 |[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](src.save/main/java/g1401_1500/s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit/Solution.java)| Medium | Array, Heap_Priority_Queue, Sliding_Window, Ordered_Set, Queue, Monotonic_Queue | 38 | 81.86
21722172
| 1437 |[Check If All 1's Are at Least Length K Places Away](src.save/main/java/g1401_1500/s1437_check_if_all_1s_are_at_least_length_k_places_away/Solution.java)| Easy | Array | 2 | 73.75
2173-
| 1436 |[Destination City](src.save/main/java/g1401_1500/s1436_destination_city/Solution.java)| Easy | String, Hash_Table |7 |11.79
2173+
| 1436 |[Destination City](src.save/main/java/g1401_1500/s1436_destination_city/Solution.java)| Easy | String, Hash_Table |3 |81.47
21742174
| 1434 |[Number of Ways to Wear Different Hats to Each Other](src.save/main/java/g1401_1500/s1434_number_of_ways_to_wear_different_hats_to_each_other/Solution.java)| Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 31 | 77.92
21752175
| 1433 |[Check If a String Can Break Another String](src.save/main/java/g1401_1500/s1433_check_if_a_string_can_break_another_string/Solution.java)| Medium | String, Sorting, Greedy | 9 | 77.89
21762176
| 1432 |[Max Difference You Can Get From Changing an Integer](src.save/main/java/g1401_1500/s1432_max_difference_you_can_get_from_changing_an_integer/Solution.java)| Medium | Math, Greedy | 1 | 97.22
@@ -3204,15 +3204,15 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
32043204
| 0113 |[Path Sum II](src.save/main/java/g0101_0200/s0113_path_sum_ii/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking, Data_Structure_II_Day_16_Tree | 1 | 100.00
32053205
| 0112 |[Path Sum](src.save/main/java/g0101_0200/s0112_path_sum/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree | 0 | 100.00
32063206
| 0111 |[Minimum Depth of Binary Tree](src.save/main/java/g0101_0200/s0111_minimum_depth_of_binary_tree/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 94.17
3207-
| 0110 |[Balanced Binary Tree](src.save/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Programming_Skills_II_Day_2 |0 |100.00
3208-
| 0109 |[Convert Sorted List to Binary Search Tree](src.save/main/java/g0101_0200/s0109_convert_sorted_list_to_binary_search_tree/Solution.java)| Medium | Tree, Binary_Tree, Linked_List, Binary_Search_Tree, Divide_and_Conquer | 1 |80.17
3207+
| 0110 |[Balanced Binary Tree](src.save/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Programming_Skills_II_Day_2 |1 |98.82
3208+
| 0109 |[Convert Sorted List to Binary Search Tree](src.save/main/java/g0101_0200/s0109_convert_sorted_list_to_binary_search_tree/Solution.java)| Medium | Tree, Binary_Tree, Linked_List, Binary_Search_Tree, Divide_and_Conquer | 1 |87.04
32093209
| 0108 |[Convert Sorted Array to Binary Search Tree](src.save/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java)| Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree | 0 | 100.00
3210-
| 0107 |[Binary Tree Level Order Traversal II](src.save/main/java/g0101_0200/s0107_binary_tree_level_order_traversal_ii/Solution.java)| Medium | Breadth_First_Search, Tree, Binary_Tree | 1 |93.94
3211-
| 0106 |[Construct Binary Tree from Inorder and Postorder Traversal](src.save/main/java/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.java)| Medium | Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer | 1 |99.20
3212-
| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src.save/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree |1 |99.69
3210+
| 0107 |[Binary Tree Level Order Traversal II](src.save/main/java/g0101_0200/s0107_binary_tree_level_order_traversal_ii/Solution.java)| Medium | Breadth_First_Search, Tree, Binary_Tree | 1 |97.71
3211+
| 0106 |[Construct Binary Tree from Inorder and Postorder Traversal](src.save/main/java/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.java)| Medium | Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer | 1 |100.00
3212+
| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src.save/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree |3 |86.35
32133213
| 0104 |[Maximum Depth of Binary Tree](src.save/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree | 0 | 100.00
3214-
| 0103 |[Binary Tree Zigzag Level Order Traversal](src.save/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_15_Tree | 1 |86.98
3215-
| 0102 |[Binary Tree Level Order Traversal](src.save/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree |0 |100.00
3214+
| 0103 |[Binary Tree Zigzag Level Order Traversal](src.save/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_15_Tree | 1 |95.00
3215+
| 0102 |[Binary Tree Level Order Traversal](src.save/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree |1 |91.09
32163216
| 0101 |[Symmetric Tree](src.save/main/java/g0101_0200/s0101_symmetric_tree/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree | 0 | 100.00
32173217
| 0100 |[Same Tree](src.save/main/java/g0001_0100/s0100_same_tree/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
32183218
| 0099 |[Recover Binary Search Tree](src.save/main/java/g0001_0100/s0099_recover_binary_search_tree/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 3 | 76.33

‎src.save/main/java/g0101_0200/s0101_symmetric_tree/Solution.java‎

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

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
44
// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree
5-
// #2022_02_21_Time_0_ms_(100.00%)_Space_40.4_MB_(34.23%)
5+
// #2022_06_22_Time_0_ms_(100.00%)_Space_42.3_MB_(46.67%)
66

77
importcom_github_leetcode.TreeNode;
88

‎src.save/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/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 #Top_Interview_Questions #Breadth_First_Search #Tree
44
// #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree
5-
// #2022_02_21_Time_0_ms_(100.00%)_Space_42.4_MB_(34.08%)
5+
// #2022_06_22_Time_1_ms_(91.09%)_Space_43.6_MB_(42.50%)
66

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

‎src.save/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java‎

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg0101_0200.s0103_binary_tree_zigzag_level_order_traversal;
22

33
// #Medium #Top_Interview_Questions #Breadth_First_Search #Tree #Binary_Tree
4-
// #Data_Structure_II_Day_15_Tree #2022_02_21_Time_1_ms_(86.98%)_Space_43.2_MB_(5.11%)
4+
// #Data_Structure_II_Day_15_Tree #2022_06_22_Time_1_ms_(95.00%)_Space_43.2_MB_(19.22%)
55

66
importcom_github_leetcode.TreeNode;
77
importjava.util.ArrayList;
@@ -43,7 +43,6 @@ public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
4343
}else {
4444
level.addFirst(node.val);
4545
}
46-
4746
if (node.left !=null) {
4847
q.add(node.left);
4948
}
@@ -54,7 +53,6 @@ public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
5453
}
5554
result.add(level);
5655
zig = !zig;
57-
5856
level =newLinkedList<>();
5957
if (!q.isEmpty()) {
6058
q.add(null);

‎src.save/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
44
// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree
55
// #Programming_Skills_I_Day_10_Linked_List_and_Tree
6-
// #2022_02_21_Time_0_ms_(100.00%)_Space_43_MB_(35.64%)
6+
// #2022_06_22_Time_0_ms_(100.00%)_Space_42.9_MB_(67.03%)
77

88
importcom_github_leetcode.TreeNode;
99

‎src.save/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/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 #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree
44
// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree
5-
// #2022_02_21_Time_1_ms_(99.69%)_Space_42.2_MB_(42.10%)
5+
// #2022_06_22_Time_3_ms_(86.35%)_Space_45.2_MB_(14.09%)
66

77
importcom_github_leetcode.TreeNode;
88
importjava.util.HashMap;

‎src.save/main/java/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.java‎

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

33
// #Medium #Array #Hash_Table #Tree #Binary_Tree #Divide_and_Conquer
4-
// #2022_02_21_Time_1_ms_(99.20%)_Space_44.6_MB_(19.25%)
4+
// #2022_06_22_Time_1_ms_(100.00%)_Space_44.7_MB_(28.54%)
55

66
importcom_github_leetcode.TreeNode;
77

‎src.save/main/java/g0101_0200/s0107_binary_tree_level_order_traversal_ii/Solution.java‎

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

33
// #Medium #Breadth_First_Search #Tree #Binary_Tree
4-
// #2022_02_21_Time_1_ms_(93.94%)_Space_43.5_MB_(20.70%)
4+
// #2022_06_22_Time_1_ms_(97.71%)_Space_43.7_MB_(42.26%)
55

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

‎src.save/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java‎

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

33
// #Easy #Top_Interview_Questions #Array #Tree #Binary_Tree #Binary_Search_Tree #Divide_and_Conquer
4-
// #Data_Structure_II_Day_15_Tree #2022_02_21_Time_0_ms_(100.00%)_Space_43.3_MB_(28.35%)
4+
// #Data_Structure_II_Day_15_Tree #2022_06_22_Time_0_ms_(100.00%)_Space_43.9_MB_(32.26%)
55

66
importcom_github_leetcode.TreeNode;
77

‎src.save/main/java/g0101_0200/s0109_convert_sorted_list_to_binary_search_tree/Solution.java‎

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

33
// #Medium #Tree #Binary_Tree #Linked_List #Binary_Search_Tree #Divide_and_Conquer
4-
// #2022_02_21_Time_1_ms_(80.17%)_Space_47.5_MB_(12.35%)
4+
// #2022_06_22_Time_1_ms_(87.04%)_Space_47.1_MB_(55.77%)
55

66
importcom_github_leetcode.ListNode;
77
importcom_github_leetcode.TreeNode;

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp