Swap Nodes in Pairs
来源:互联网 发布:淘宝01店手机是真的吗 编辑:程序博客网 时间:2024/06/05 06:28
24. Swap Nodes in Pairs
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.
Subscribe to see which companies asked this question
/** * 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) { ListNode *ans=new ListNode(0); ans->next=head; ListNode *cur=ans; while(cur && cur->next && cur->next->next){ ListNode *first=cur->next; ListNode *second=first->next; ListNode *three=second->next; first->next=three; second->next=first; cur->next=second; cur=first; } return ans->next; }};
0 0
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes In Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- Swap Nodes in Pairs
- 1031. Hello World for U (20)
- spring的工作原理总结
- [MTK] BT驱动调试总结
- glog 的使用
- Activity跳转交换数据
- Swap Nodes in Pairs
- 自定义分享
- C++中 构造函数 析构函数 能否调用虚函数的问题
- VS 调试和承载进程
- *.c~文件
- 小白笔记----------------------Mysql5.7.12之字符集设置
- adb怎么判断是否有root权限,并更改system/app内容
- 【程序中打印调用栈信息方法】 backtrace和backtrace_symbols函数
- 多线程