Implement q_swap using q_reverseK with k=2

yy214123 · yy214123 · commit a8e6d356bda0 · 2025-03-19T16:28:11.000+08:00
Previously, q_swap was a placeholder and did nothing.
Now it correctly swaps adjacent nodes by calling
q_reverseK with k=2, as swapping pairs is a special
case of k-group reversal.

Change-Id: Ia35f40364457b6877c80764452a6cf3409dafd78
diff --git a/queue.c b/queue.c
@@ -158,6 +158,7 @@ bool q_delete_dup(struct list_head *head)
 void q_swap(struct list_head *head)
 {
     // https://leetcode.com/problems/swap-nodes-in-pairs/
+    q_reverseK(head, 2);
 }
 
 /* Reverse elements in queue */

Original file line number	Diff line number	Diff line change
`@@ -158,6 +158,7 @@ bool q_delete_dup(struct list_head *head)`
`158`	`158`	`void q_swap(struct list_head *head)`
`159`	`159`	`{`
`160`	`160`	`// https://leetcode.com/problems/swap-nodes-in-pairs/`
	`161`	`+ q_reverseK(head, 2);`
`161`	`162`	`}`
`162`	`163`
`163`	`164`	`/* Reverse elements in queue */`