Improved tags

javadev · Aug 14, 2024 · 9917fde · 9917fde
1 parent 6835a51
commit 9917fde
Show file tree

Hide file tree

Showing 5 changed files with 15 additions and 10 deletions.
diff --git a/src/main/java/g3201_3300/s3217_delete_nodes_from_linked_list_present_in_array/Solution.java b/src/main/java/g3201_3300/s3217_delete_nodes_from_linked_list_present_in_array/Solution.java
@@ -1,13 +1,18 @@
 package g3201_3300.s3217_delete_nodes_from_linked_list_present_in_array;
 
-import com_github_leetcode.ListNode;
-
 // #Medium #Array #Hash_Table #Linked_List #2024_07_18_Time_3_ms_(100.00%)_Space_63.9_MB_(93.81%)
 
-/**
- * Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode() {}
- * ListNode(int val) { this.val = val; } ListNode(int val, ListNode next) { this.val = val;
- * this.next = next; } }
+import com_github_leetcode.ListNode;
+
+/*
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
  */
 public class Solution {
     public ListNode modifiedList(int[] nums, ListNode head) {

diff --git a/src/main/java/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/Solution.java b/src/main/java/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable/Solution.java
@@ -1,6 +1,6 @@
 package g3201_3300.s3235_check_if_the_rectangle_corner_is_reachable;
 
-// #Hard #Array #Math #Union_Find #Geometry #Depth_First_Search #Breadth_First_Search
+// #Hard #Array #Math #Depth_First_Search #Breadth_First_Search #Union_Find #Geometry
 // #2024_08_02_Time_95_ms_(59.46%)_Space_44.8_MB_(94.44%)
 
 import java.util.Arrays;

diff --git a/src/main/java/g3201_3300/s3241_time_taken_to_mark_all_nodes/Solution.java b/src/main/java/g3201_3300/s3241_time_taken_to_mark_all_nodes/Solution.java
@@ -1,6 +1,6 @@
 package g3201_3300.s3241_time_taken_to_mark_all_nodes;
 
-// #Hard #Dynamic_Programming #Tree #Graph #Depth_First_Search
+// #Hard #Dynamic_Programming #Depth_First_Search #Tree #Graph
 // #2024_08_06_Time_39_ms_(100.00%)_Space_115.8_MB_(83.90%)
 
 import java.util.Arrays;

diff --git a/src/main/java/g3201_3300/s3243_shortest_distance_after_road_addition_queries_i/Solution.java b/src/main/java/g3201_3300/s3243_shortest_distance_after_road_addition_queries_i/Solution.java
@@ -1,6 +1,6 @@
 package g3201_3300.s3243_shortest_distance_after_road_addition_queries_i;
 
-// #Medium #Array #Graph #Breadth_First_Search
+// #Medium #Array #Breadth_First_Search #Graph
 // #2024_08_06_Time_6_ms_(100.00%)_Space_45.6_MB_(67.96%)
 
 import java.util.ArrayList;

diff --git a/src/main/java/g3201_3300/s3249_count_the_number_of_good_nodes/Solution.java b/src/main/java/g3201_3300/s3249_count_the_number_of_good_nodes/Solution.java
@@ -1,6 +1,6 @@
 package g3201_3300.s3249_count_the_number_of_good_nodes;
 
-// #Medium #Tree #Depth_First_Search #2024_08_13_Time_34_ms_(100.00%)_Space_113.9_MB_(90.70%)
+// #Medium #Depth_First_Search #Tree #2024_08_13_Time_34_ms_(100.00%)_Space_113.9_MB_(90.70%)
 
 import java.util.ArrayList;
 import java.util.List;