[leetcode] 24. Swap Nodes in Pairs
来源:互联网 发布:yessuperstore淘宝 编辑:程序博客网 时间:2024/06/05 06:20
Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4
, you should return the list as 2->1->4->3
.
Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.
Solution 1
Idea: recursive function
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* swapPairs(ListNode* head) { if(!head) return head; if(!head->next) return head; ListNode* next = head->next; head->next = swapPairs(next->next); next->next = head; return next; }};
Solution 2
0 0
- [LeetCode]24.Swap Nodes in Pairs
- 24. Swap Nodes in Pairs Leetcode Python
- LeetCode --- 24. Swap Nodes in Pairs
- LeetCode 24.Swap Nodes in Pairs
- [Leetcode] 24. Swap Nodes in Pairs
- 【LeetCode】24.Swap Nodes in Pairs
- [leetcode] 24.Swap Nodes in Pairs
- **LeetCode 24. Swap Nodes in Pairs
- 24. Swap Nodes in Pairs LeetCode
- leetcode 24. Swap Nodes in Pairs
- leetcode 24. Swap Nodes in Pairs
- LeetCode--24. Swap Nodes in Pairs
- leetcode 24. Swap Nodes in Pairs
- 【LeetCode】24. Swap Nodes in Pairs
- [leetcode] 24. Swap Nodes in Pairs
- LeetCode 24. Swap Nodes in Pairs
- LeetCode-24.Swap Nodes in Pairs
- LeetCode 24. Swap Nodes in Pairs
- Spring Annotaion Support
- Windows 8.1 PLSQL_32连接到RHEL6.1 Oracle10gr2_64
- 基于Spring的多数据源(Druid)定时任务项目开发(一)<带Demo>
- 查看LUN对应的HBA、查看HBA的WWN信息
- LeetCode--No.53--Maximum Subarray
- [leetcode] 24. Swap Nodes in Pairs
- LeetCode--No.237--Delete Node In a Linked List
- 用python自动发微博
- 勾股定理一日一证连载13
- 随笔:写给我深爱的球队
- JavaScript Array 原型方法 大盘点
- 多线程之_beginThreadex的用法
- 多线程之常用api
- hdu 1233 还是畅通工程(最小生成树,prim,kruskal)