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

Commit71e89b7

Browse files
authored
Updated tasks 221-338
1 parent3fe7a5c commit71e89b7

File tree

15 files changed

+48
-55
lines changed

15 files changed

+48
-55
lines changed

‎README.md

Lines changed: 24 additions & 24 deletions
Large diffs are not rendered by default.

‎src/main/java/g0201_0300/s0221_maximal_square/Solution.java

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

33
// #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16
4-
// #Big_O_Time_O(m*n)_Space_O(m*n) #2022_07_04_Time_7_ms_(72.35%)_Space_59.5_MB_(10.55%)
4+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_11_16_Time_6_ms_(97.07%)_Space_60.3_MB_(39.55%)
55

66
publicclassSolution {
77
publicintmaximalSquare(char[][]matrix) {

‎src/main/java/g0201_0300/s0226_invert_binary_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 #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
44
// #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue
5-
// #Big_O_Time_O(n)_Space_O(n) #2022_07_04_Time_0_ms_(100.00%)_Space_42_MB_(20.73%)
5+
// #Big_O_Time_O(n)_Space_O(n) #2024_11_16_Time_0_ms_(100.00%)_Space_40.6_MB_(95.51%)
66

77
importcom_github_leetcode.TreeNode;
88

‎src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/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 #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
44
// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n)
5-
// #2022_07_04_Time_1_ms_(78.91%)_Space_45.3_MB_(58.87%)
5+
// #2024_11_16_Time_0_ms_(100.00%)_Space_44.3_MB_(63.70%)
66

77
importcom_github_leetcode.TreeNode;
88

‎src/main/java/g0201_0300/s0234_palindrome_linked_list/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 #Two_Pointers #Stack #Linked_List #Recursion
44
// #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
5-
// #2022_07_04_Time_6_ms_(76.07%)_Space_97.6_MB_(56.14%)
5+
// #2024_11_16_Time_4_ms_(84.46%)_Space_69_MB_(17.17%)
66

77
importcom_github_leetcode.ListNode;
88

‎src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/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 #Depth_First_Search #Tree #Binary_Tree
44
// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
5-
// #2022_07_04_Time_10_ms_(56.51%)_Space_47.4_MB_(45.84%)
5+
// #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%)
66

77
importcom_github_leetcode.TreeNode;
88

Lines changed: 11 additions & 18 deletions
Original file line numberDiff line numberDiff line change
@@ -1,28 +1,21 @@
11
packageg0201_0300.s0238_product_of_array_except_self;
22

33
// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays
4-
// #Big_O_Time_O(n^2)_Space_O(n) #2022_07_04_Time_1_ms_(100.00%)_Space_50.8_MB_(85.60%)
4+
// #Big_O_Time_O(n^2)_Space_O(n) #2024_11_16_Time_1_ms_(99.66%)_Space_55.1_MB_(79.02%)
55

66
publicclassSolution {
77
publicint[]productExceptSelf(int[]nums) {
8-
intproduct =1;
9-
int[]ans =newint[nums.length];
10-
for (intnum :nums) {
11-
product =product *num;
12-
}
8+
int[]res =newint[nums.length];
9+
intprefixProduct =1;
1310
for (inti =0;i <nums.length;i++) {
14-
if (nums[i] !=0) {
15-
ans[i] =product /nums[i];
16-
}else {
17-
intp =1;
18-
for (intj =0;j <nums.length;j++) {
19-
if (j !=i) {
20-
p =p *nums[j];
21-
}
22-
}
23-
ans[i] =p;
24-
}
11+
res[i] =prefixProduct;
12+
prefixProduct *=nums[i];
13+
}
14+
intsuffixProduct =1;
15+
for (inti =nums.length -1;i >=0;i--) {
16+
res[i] *=suffixProduct;
17+
suffixProduct *=nums[i];
2518
}
26-
returnans;
19+
returnres;
2720
}
2821
}

‎src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java

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

33
// #Hard #Top_100_Liked_Questions #Array #Heap_Priority_Queue #Sliding_Window #Queue
44
// #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
5-
// #2022_07_04_Time_58_ms_(52.28%)_Space_145_MB_(50.60%)
5+
// #2024_11_16_Time_26_ms_(95.89%)_Space_59.6_MB_(38.70%)
66

77
importjava.util.LinkedList;
88

‎src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/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 #Array #Binary_Search #Matrix #Divide_and_Conquer
44
// #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 #Big_O_Time_O(n+m)_Space_O(1)
5-
// #2022_07_04_Time_7_ms_(86.73%)_Space_58.4_MB_(9.95%)
5+
// #2024_11_16_Time_5_ms_(99.92%)_Space_45.8_MB_(60.21%)
66

77
publicclassSolution {
88
publicbooleansearchMatrix(int[][]matrix,inttarget) {

‎src/main/java/g0201_0300/s0283_move_zeroes/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 #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
44
// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
5-
// #2022_07_06_Time_2_ms_(79.54%)_Space_55.7_MB_(5.98%)
5+
// #2024_11_16_Time_2_ms_(83.99%)_Space_45.9_MB_(50.99%)
66

77
publicclassSolution {
88
publicvoidmoveZeroes(int[]nums) {

‎src/main/java/g0201_0300/s0287_find_the_duplicate_number/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 #Array #Binary_Search #Two_Pointers #Bit_Manipulation
44
// #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
5-
// #2022_07_06_Time_2_ms_(99.82%)_Space_61.1_MB_(83.92%)
5+
// #2024_11_16_Time_2_ms_(97.52%)_Space_59.9_MB_(5.22%)
66

77
publicclassSolution {
88
publicintfindDuplicate(int[]nums) {

‎src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java

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

33
// #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream
4-
// #Big_O_Time_O(n*log_n)_Space_O(n) #2022_07_06_Time_151_ms_(80.24%)_Space_125.2_MB_(44.11%)
4+
// #Big_O_Time_O(n*log_n)_Space_O(n) #2024_11_16_Time_83_ms_(99.56%)_Space_63.4_MB_(77.85%)
55

66
importjava.util.PriorityQueue;
77

‎src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search
44
// #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18
55
// #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n)
6-
// #2022_07_06_Time_3_ms_(98.63%)_Space_44.3_MB_(60.27%)
6+
// #2024_11_16_Time_3_ms_(95.75%)_Space_43.7_MB_(93.58%)
77

88
publicclassSolution {
99
publicintlengthOfLIS(int[]nums) {

‎src/main/java/g0301_0400/s0322_coin_change/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search
44
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
55
// #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount)
6-
// #2022_07_09_Time_17_ms_(91.77%)_Space_41.8_MB_(95.50%)
6+
// #2024_11_16_Time_12_ms_(92.59%)_Space_44.3_MB_(64.02%)
77

88
publicclassSolution {
99
publicintcoinChange(int[]coins,intamount) {

‎src/main/java/g0301_0400/s0338_counting_bits/Solution.java

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

33
// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
4-
// #Big_O_Time_O(num)_Space_O(num) #2022_07_10_Time_2_ms_(86.73%)_Space_48.3_MB_(31.59%)
4+
// #Big_O_Time_O(num)_Space_O(num) #2024_11_16_Time_2_ms_(96.37%)_Space_46.4_MB_(70.53%)
55

66
publicclassSolution {
77
publicint[]countBits(intnum) {

0 commit comments

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