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

Commit741f421

Browse files
authored
Updated tags for tasks 206-239
1 parentccfb61b commit741f421

File tree

11 files changed

+51
-41
lines changed

11 files changed

+51
-41
lines changed

‎src/main/go/g0201_0300/s0206_reverse_linked_list/solution.go‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
package 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_03_22_Time_2_ms_(76.97%)_Space_2.7_MB_(21.67%)
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) #2025_05_09_Time_0_ms_(100.00%)_Space_4.36_MB_(95.25%)
77

88
typeListNodestruct {
99
Valint

‎src/main/go/g0201_0300/s0207_course_schedule/solution.go‎

Lines changed: 32 additions & 23 deletions
Original file line numberDiff line numberDiff line change
@@ -2,36 +2,45 @@ package s0207_course_schedule
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search
44
// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General
5-
// #Big_O_Time_O(N)_Space_O(N) #2024_03_22_Time_7_ms_(83.17%)_Space_6.3_MB_(51.07%)
5+
// #Big_O_Time_O(N)_Space_O(N) #2025_05_09_Time_0_ms_(100.00%)_Space_7.98_MB_(72.75%)
6+
7+
typeStateint
8+
9+
const (
10+
UnvisitedState=iota
11+
Visiting
12+
Visited
13+
)
614

715
funccanFinish(numCoursesint,prerequisites [][]int)bool {
8-
graph:=map[int][]int{}
9-
for_,edge:=rangeprerequisites {
10-
graph[edge[1]]=append(graph[edge[1]],edge[0])
16+
visited:=make([]State,numCourses)
17+
graph:=make([][]int,numCourses)
18+
for_,dep:=rangeprerequisites {
19+
graph[dep[1]]=append(graph[dep[1]],dep[0])
1120
}
12-
indegree:=make([]int,numCourses)
13-
queue:= []int{}
1421
fori:=0;i<numCourses;i++ {
15-
for_,v:=rangegraph[i] {
16-
indegree[v]++
22+
ifvisited[i]==Unvisited {
23+
if!dfs(i,visited,graph) {
24+
returnfalse
25+
}
1726
}
1827
}
19-
fori:=0;i<numCourses;i++ {
20-
ifindegree[i]==0 {
21-
queue=append(queue,i)
22-
}
28+
returntrue
29+
}
30+
31+
funcdfs(startint,visited []State,graph [][]int)bool {
32+
ifvisited[start]==Visiting {
33+
returnfalse
2334
}
24-
visited:=0
25-
forlen(queue)>0 {
26-
node:=queue[0]
27-
queue=queue[1:]
28-
visited++
29-
for_,v:=rangegraph[node] {
30-
indegree[v]--
31-
ifindegree[v]==0 {
32-
queue=append(queue,v)
33-
}
35+
ifvisited[start]==Visited {
36+
returntrue
37+
}
38+
visited[start]=Visiting
39+
for_,next:=rangegraph[start] {
40+
if!dfs(next,visited,graph) {
41+
returnfalse
3442
}
3543
}
36-
returnvisited==numCourses
44+
visited[start]=Visited
45+
returntrue
3746
}

‎src/main/go/g0201_0300/s0208_implement_trie_prefix_tree/trie.go‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
package 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)
6-
// #2024_03_22_Time_40_ms_(94.90%)_Space_8.6_MB_(96.69%)
6+
// #2025_05_09_Time_11_ms_(98.49%)_Space_16.18_MB_(42.49%)
77

88
import"strings"
99

‎src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array/solution.go‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
package 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_03_22_Time_62_ms_(98.32%)_Space_7.5_MB_(94.86%)
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)) #2025_05_09_Time_17_ms_(83.49%)_Space_10.00_MB_(66.67%)
77

88
import"sort"
99

‎src/main/go/g0201_0300/s0221_maximal_square/solution.go‎

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

33
// #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16
44
// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n)
5-
// #2024_03_22_Time_0_ms_(100.00%)_Space_7_MB_(29.80%)
5+
// #2025_05_09_Time_1_ms_(93.36%)_Space_8.70_MB_(81.82%)
66

77
funcmaximalSquare(matrix [][]byte)int {
88
m:=len(matrix)

‎src/main/go/g0201_0300/s0226_invert_binary_tree/solution.go‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0226_invert_binary_tree
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
55
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
6-
// #2024_03_22_Time_0_ms_(100.00%)_Space_2.4_MB_(5.25%)
6+
// #2025_05_09_Time_0_ms_(100.00%)_Space_4.17_MB_(55.19%)
77

88
typeTreeNodestruct {
99
Valint

‎src/main/go/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.go‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ package s0230_kth_smallest_element_in_a_bst
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
55
// #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n)
6-
// #2024_03_22_Time_0_ms_(100.00%)_Space_6.4_MB_(46.83%)
6+
// #2025_05_09_Time_0_ms_(100.00%)_Space_8.52_MB_(17.71%)
77

88
typeTreeNodestruct {
99
Valint

‎src/main/go/g0201_0300/s0234_palindrome_linked_list/solution.go‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package s0234_palindrome_linked_list
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-
// #2024_03_23_Time_104_ms_(97.77%)_Space_8.2_MB_(84.40%)
5+
// #2025_05_09_Time_1_ms_(87.36%)_Space_10.64_MB_(70.30%)
66

77
typeListNodestruct {
88
Valint

‎src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.go‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,9 @@
11
package 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_03_23_Time_5_ms_(90.18%)_Space_7.7_MB_(22.79%)
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+
// #2025_05_09_Time_5_ms_(89.93%)_Space_9.14_MB_(38.67%)
67

78
typeTreeNodestruct {
89
Valint

‎src/main/go/g0201_0300/s0238_product_of_array_except_self/solution.go‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package 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_03_23_Time_20_ms_(77.65%)_Space_7.8_MB_(37.12%)
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) #2025_05_09_Time_0_ms_(100.00%)_Space_9.70_MB_(86.27%)
66

77
funcproductExceptSelf(nums []int) []int {
88
n:=len(nums)

0 commit comments

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