Commit9917fde

authored

Improved tags

1 parent6835a51 commit9917fdeCopy full SHA for 9917fde

File tree

+15

-10

lines changed

+15

-10

lines changed

Lines changed: 11 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,13 +1,18 @@`
`1`	`1`	`packageg3201_3300.s3217_delete_nodes_from_linked_list_present_in_array;`
`2`	`2`
`3`		`-importcom_github_leetcode.ListNode;`
`4`		`-`
`5`	`3`	`// #Medium #Array #Hash_Table #Linked_List #2024_07_18_Time_3_ms_(100.00%)_Space_63.9_MB_(93.81%)`
`6`	`4`
`7`		`-/**`
`8`		`- * Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode() {}`
`9`		`- * ListNode(int val) { this.val = val; } ListNode(int val, ListNode next) { this.val = val;`
`10`		`- * this.next = next; } }`
	`5`	`+importcom_github_leetcode.ListNode;`
	`6`	`+`
	`7`	`+/*`
	`8`	`+ * Definition for singly-linked list.`
	`9`	`+ * public class ListNode {`
	`10`	`+ * int val;`
	`11`	`+ * ListNode next;`
	`12`	`+ * ListNode() {}`
	`13`	`+ * ListNode(int val) { this.val = val; }`
	`14`	`+ * ListNode(int val, ListNode next) { this.val = val; this.next = next; }`
	`15`	`+ * }`
`11`	`16`	`*/`
`12`	`17`	`publicclassSolution {`
`13`	`18`	`publicListNodemodifiedList(int[]nums,ListNodehead) {`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`packageg3201_3300.s3235_check_if_the_rectangle_corner_is_reachable;`
`2`	`2`
`3`		`-// #Hard #Array #Math #Union_Find #Geometry #Depth_First_Search #Breadth_First_Search`
	`3`	`+// #Hard #Array #Math #Depth_First_Search #Breadth_First_Search #Union_Find #Geometry`
`4`	`4`	`// #2024_08_02_Time_95_ms_(59.46%)_Space_44.8_MB_(94.44%)`
`5`	`5`
`6`	`6`	`importjava.util.Arrays;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`packageg3201_3300.s3241_time_taken_to_mark_all_nodes;`
`2`	`2`
`3`		`-// #Hard #Dynamic_Programming #Tree #Graph #Depth_First_Search`
	`3`	`+// #Hard #Dynamic_Programming #Depth_First_Search #Tree #Graph`
`4`	`4`	`// #2024_08_06_Time_39_ms_(100.00%)_Space_115.8_MB_(83.90%)`
`5`	`5`
`6`	`6`	`importjava.util.Arrays;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`packageg3201_3300.s3243_shortest_distance_after_road_addition_queries_i;`
`2`	`2`
`3`		`-// #Medium #Array #Graph #Breadth_First_Search`
	`3`	`+// #Medium #Array #Breadth_First_Search #Graph`
`4`	`4`	`// #2024_08_06_Time_6_ms_(100.00%)_Space_45.6_MB_(67.96%)`
`5`	`5`
`6`	`6`	`importjava.util.ArrayList;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`packageg3201_3300.s3249_count_the_number_of_good_nodes;`
`2`	`2`
`3`		`-// #Medium #Tree #Depth_First_Search #2024_08_13_Time_34_ms_(100.00%)_Space_113.9_MB_(90.70%)`
	`3`	`+// #Medium #Depth_First_Search #Tree #2024_08_13_Time_34_ms_(100.00%)_Space_113.9_MB_(90.70%)`
`4`	`4`
`5`	`5`	`importjava.util.ArrayList;`
`6`	`6`	`importjava.util.List;`

Comments

(0)