package
Version:
v1.6.3
Opens a new window with list of versions in this module.
Published: May 30, 2020
License: MIT
Opens a new window with license information.
Imports: 0
Opens a new window with list of imports.
Imported by: 0
Opens a new window with list of known importers.
README
¶
< Previous
Next >
Given a linked list, swap every two adjacent nodes and return its head.
You may not modify the values in the list's nodes, only nodes itself may be changed.
Example:
Given 1->2->3->4
, you should return the list as 2->1->4->3
.
[Linked List]
Similar Questions
- Reverse Nodes in k-Group (Hard)
Documentation
¶
There is no documentation for this package.
Source Files
¶
Click to show internal directories.
Click to hide internal directories.