diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/swap_nodes_pairs.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/swap_nodes_pairs.cpp')
-rw-r--r-- | other/swap_nodes_pairs.cpp | 21 |
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; - } -}; |