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

Commit32be484

Browse files
authored
Updated readme and tags
1 parentbefac22 commit32be484

File tree

19 files changed

+178
-174
lines changed

19 files changed

+178
-174
lines changed

‎LeetCodeNet/G0001_0100/S0011_container_with_most_water/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.G0001_0100.S0011_container_with_most_water{
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
4-
// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
5-
// #2024_01_11_Time_251_ms_(30.70%)_Space_61.5_MB_(26.65%)
4+
// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers
5+
// #Big_O_Time_O(n)_Space_O(1) #2024_01_11_Time_251_ms_(30.70%)_Space_61.5_MB_(26.65%)
66

77
publicclassSolution{
88
publicintMaxArea(int[]height){

‎LeetCodeNet/G0001_0100/S0017_letter_combinations_of_a_phone_number/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.G0001_0100.S0017_letter_combinations_of_a_phone_number{
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
4-
// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
4+
// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking
5+
// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
66
// #2023_12_26_Time_108_ms_(95.24%)_Space_46.3_MB_(5.39%)
77

88
usingSystem.Text;

‎LeetCodeNet/G0001_0100/S0062_unique_paths/Solution.cs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
namespaceLeetCodeNet.G0001_0100.S0062_unique_paths{
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math
4-
// #Combinatorics #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_15
5-
// #Level_1_Day_11_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
6-
// #2024_01_05_Time_16_ms_(93.42%)_Space_26.2_MB_(96.08%)
4+
// #Combinatorics #LeetCode_75_DP/Multidimensional #Algorithm_II_Day_13_Dynamic_Programming
5+
// #Dynamic_Programming_I_Day_15 #Level_1_Day_11_Dynamic_Programming
6+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_01_05_Time_16_ms_(93.42%)_Space_26.2_MB_(96.08%)
77

88
publicclassSolution{
99
publicintUniquePaths(intm,intn){

‎LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
namespaceLeetCodeNet.G0001_0100.S0072_edit_distance{
22

3-
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
3+
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
44
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
55
// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
66
// #2024_01_05_Time_51_ms_(95.38%)_Space_44.5_MB_(20.65%)

‎LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.G0101_0200.S0104_maximum_depth_of_binary_tree{
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
4-
// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree
4+
// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree
55
// #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue
66
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H)
77
// #2024_01_09_Time_65_ms_(93.31%)_Space_42.3_MB_(9.74%)

‎LeetCodeNet/G0101_0200/S0136_single_number/Solution.cs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
namespaceLeetCodeNet.G0101_0200.S0136_single_number{
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation
4-
// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers
5-
// #Top_Interview_150_Bit_Manipulation #Big_O_Time_O(N)_Space_O(1)
6-
// #2024_01_09_Time_87_ms_(93.37%)_Space_45.1_MB_(38.04%)
4+
// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array
5+
// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation
6+
// #Big_O_Time_O(N)_Space_O(1) #2024_01_09_Time_87_ms_(93.37%)_Space_45.1_MB_(38.04%)
77

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

‎LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.G0101_0200.S0198_house_robber{
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
4-
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
4+
// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
55
// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
66
// #Big_O_Time_O(n)_Space_O(n) #2024_01_11_Time_44_ms_(99.89%)_Space_39.8_MB_(13.60%)
77

‎LeetCodeNet/G0201_0300/S0206_reverse_linked_list/Solution.cs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
namespaceLeetCodeNet.G0201_0300.S0206_reverse_linked_list{
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
4-
// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
5-
// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1)
6-
// #2024_01_10_Time_57_ms_(95.02%)_Space_40.9_MB_(19.99%)
4+
// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List
5+
// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List
6+
// #Big_O_Time_O(N)_Space_O(1) #2024_01_10_Time_57_ms_(95.02%)_Space_40.9_MB_(19.99%)
77

88
usingLeetCodeNet.Com_github_leetcode;
99

‎LeetCodeNet/G0201_0300/S0208_implement_trie_prefix_tree/Trie.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.G0201_0300.S0208_implement_trie_prefix_tree{
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie
4-
// #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie
4+
// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie
55
// #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)
66
// #2024_01_10_Time_178_ms_(88.12%)_Space_133.5_MB_(9.47%)
77

‎LeetCodeNet/G0201_0300/S0215_kth_largest_element_in_an_array/Solution.cs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
namespaceLeetCodeNet.G0201_0300.S0215_kth_largest_element_in_an_array{
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue
4-
// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue
5-
// #Top_Interview_150_Heap #Big_O_Time_O(n*log(n))_Space_O(log(n))
6-
// #2024_01_10_Time_252_ms_(46.14%)_Space_55_MB_(26.22%)
4+
// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue
5+
// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap
6+
// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2024_01_10_Time_252_ms_(46.14%)_Space_55_MB_(26.22%)
77

88
usingSystem;
99

‎LeetCodeNet/G0201_0300/S0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,9 @@
11
namespaceLeetCodeNet.G0201_0300.S0236_lowest_common_ancestor_of_a_binary_tree{
22

33
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
4-
// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
5-
// #Big_O_Time_O(n)_Space_O(n) #2024_01_10_Time_76_ms_(98.04%)_Space_45.9_MB_(13.60%)
4+
// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
5+
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
6+
// #2024_01_10_Time_76_ms_(98.04%)_Space_45.9_MB_(13.60%)
67

78
usingLeetCodeNet.Com_github_leetcode;
89

‎LeetCodeNet/G0201_0300/S0238_product_of_array_except_self/Solution.cs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.G0201_0300.S0238_product_of_array_except_self{
22

3-
// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays
4-
// #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n)
5-
// #2024_01_10_Time_141_ms_(94.24%)_Space_58.3_MB_(10.01%)
3+
// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String
4+
// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String
5+
// #Big_O_Time_O(n^2)_Space_O(n) #2024_01_10_Time_141_ms_(94.24%)_Space_58.3_MB_(10.01%)
66

77
publicclassSolution{
88
publicint[]ProductExceptSelf(int[]nums){

‎LeetCodeNet/G0201_0300/S0283_move_zeroes/Solution.cs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.G0201_0300.S0283_move_zeroes{
22

3-
// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
4-
// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
5-
// #2024_01_07_Time_133_ms_(96.30%)_Space_57_MB_(17.07%)
3+
// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers
4+
// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays
5+
// #Big_O_Time_O(n)_Space_O(1) #2024_01_07_Time_133_ms_(96.30%)_Space_57_MB_(17.07%)
66

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

‎LeetCodeNet/G0301_0400/S0338_counting_bits/Solution.cs

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
namespaceLeetCodeNet.G0301_0400.S0338_counting_bits{
22

3-
// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
4-
// #Big_O_Time_O(num)_Space_O(num) #2024_01_07_Time_67_ms_(98.82%)_Space_42.1_MB_(22.68%)
3+
// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
4+
// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
5+
// #2024_01_07_Time_67_ms_(98.82%)_Space_42.1_MB_(22.68%)
56

67
publicclassSolution{
78
publicint[]CountBits(intnum){

‎LeetCodeNet/G0301_0400/S0394_decode_string/Solution.cs

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
namespaceLeetCodeNet.G0301_0400.S0394_decode_string{
22

3-
// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
4-
// #Big_O_Time_O(n)_Space_O(n) #2024_01_07_Time_44_ms_(99.55%)_Space_38.2_MB_(26.91%)
3+
// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack
4+
// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
5+
// #2024_01_07_Time_44_ms_(99.55%)_Space_38.2_MB_(26.91%)
56

67
usingSystem.Text;
78

‎LeetCodeNet/G0401_0500/S0437_path_sum_iii/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.G0401_0500.S0437_path_sum_iii{
22

3-
// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
4-
// #2024_01_05_Time_76_ms_(97.16%)_Space_42.8_MB_(29.79%)
3+
// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree
4+
// #Big_O_Time_O(n)_Space_O(n) #2024_01_05_Time_76_ms_(97.16%)_Space_42.8_MB_(29.79%)
55

66
usingLeetCodeNet.Com_github_leetcode;
77

‎LeetCodeNet/G0701_0800/S0739_daily_temperatures/Solution.cs

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
namespaceLeetCodeNet.G0701_0800.S0739_daily_temperatures{
22

3-
// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
4-
// #Big_O_Time_O(n)_Space_O(n) #2024_01_07_Time_376_ms_(44.29%)_Space_71.9_MB_(21.96%)
3+
// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack
4+
// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n)
5+
// #2024_01_07_Time_376_ms_(44.29%)_Space_71.9_MB_(21.96%)
56

67
publicclassSolution{
78
publicint[]DailyTemperatures(int[]temperatures){

‎LeetCodeNet/G1101_1200/S1143_longest_common_subsequence/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
namespaceLeetCodeNet.G1101_1200.S1143_longest_common_subsequence{
22

3-
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
3+
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
44
// #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19
55
// #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m)
66
// #2024_01_07_Time_59_ms_(90.45%)_Space_41.3_MB_(54.32%)

0 commit comments

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