Classify adjacent operations by name

Author: jserv

queue.c

@@ -73,6 +73,12 @@ void q_swap(struct list_head *head)
 /* Reverse elements in queue */
 void q_reverse(struct list_head *head) {}
 
+/* Reverse the nodes of the list k at a time */
+void q_reverseK(struct list_head *head, int k)
+{
+    // https://leetcode.com/problems/reverse-nodes-in-k-group/
+}
+
 /* Sort elements of queue in ascending order */
 void q_sort(struct list_head *head) {}
 
@@ -83,8 +89,3 @@ int q_descend(struct list_head *head)
     // https://leetcode.com/problems/remove-nodes-from-linked-list/description/
     return 0;
 }
-
-void q_reverseK(struct list_head *head, int k)
-{
-    // https://leetcode.com/problems/reverse-nodes-in-k-group/
-}

queue.h

@@ -161,6 +161,21 @@ void q_swap(struct list_head *head);
  */
 void q_reverse(struct list_head *head);
 
+/**
+ * q_reverseK() - Given the head of a linked list, reverse the nodes of the list
+ * k at a time, and return the modified list.
+ * @head: header of queue
+ * @k: is a positive integer and is less than or equal to the length of the
+ * linked list.
+ *
+ * No effect if queue is NULL or empty. If there has only one element, do
+ * nothing.
+ *
+ * Reference:
+ * https://leetcode.com/problems/reverse-nodes-in-k-group/
+ */
+void q_reverseK(struct list_head *head, int k);
+
 /**
  * q_sort() - Sort elements of queue in ascending order
  * @head: header of queue
@@ -185,18 +200,4 @@ void q_sort(struct list_head *head);
  */
 int q_descend(struct list_head *head);
 
-/**
- * q_reverseK() - Given the head of a linked list, reverse the nodes of the list
- * k at a time, and return the modified list.
- * @head: header of queue
- * @k: is a positive integer and is less than or equal to the length of the
- * linked list.
- *
- * No effect if queue is NULL or empty. If there has only one element, do
- * nothing.
- *
- * Reference:
- * https://leetcode.com/problems/reverse-nodes-in-k-group/
- */
-void q_reverseK(struct list_head *head, int k);
 #endif /* LAB0_QUEUE_H */

scripts/checksums

@@ -1,2 +1,2 @@
-83eab631638b12f2dcd91b1a3e539efee016e305  queue.h
+074eed9d04bf8c7de83bab1f7cacf2ea4f9b8ae8  queue.h
 3337dbccc33eceedda78e36cc118d5a374838ec7  list.h