aboutsummaryrefslogtreecommitdiff
path: root/other/swap_nodes_pairs.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'other/swap_nodes_pairs.cpp')
-rw-r--r--other/swap_nodes_pairs.cpp21
1 files changed, 0 insertions, 21 deletions
diff --git a/other/swap_nodes_pairs.cpp b/other/swap_nodes_pairs.cpp
deleted file mode 100644
index 139c336..0000000
--- a/other/swap_nodes_pairs.cpp
+++ /dev/null
@@ -1,21 +0,0 @@
-// 24. Swap Nodes in Pairs
-#include "leetcode.h"
-
-/*
- * given a linked list, swap every two adjacent nodes and return
- * its head. problem must be solved without modifying values
- * in the list's nodes (ie only nodes themselves may be changed)
- */
-
-class Solution {
-public:
- ListNode *swapPairs(ListNode *head) {
- if (!head || !head->next)
- return head;
- ListNode *tmp;
- tmp = head->next;
- head->next = swapPairs(head->next->next);
- tmp->next = head;
- return tmp;
- }
-};