deven/leetcode
1
0
Fork 0
mirror of https://github.com/devenperez/leetcode.git synced 2026-06-13 14:57:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Create README - LeetHub

Browse Source
This commit is contained in:
Deven
2023-01-19 22:07:29 -05:00
parent 70bbefa745
commit 9ea97eac92
1 changed files with 29 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
24-swap-nodes-in-pairs/README.md
+29
View File
@@ -0,0 +1,29 @@
<h2><a href="https://leetcode.com/problems/swap-nodes-in-pairs/">24. Swap Nodes in Pairs</a></h2><h3>Medium</h3><hr><div><p>Given a&nbsp;linked list, swap every two adjacent nodes and return its head. You must solve the problem without&nbsp;modifying the values in the list's nodes (i.e., only nodes themselves may be changed.)</p>
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/03/swap_ex1.jpg" style="width: 422px; height: 222px;">
<pre><strong>Input:</strong> head = [1,2,3,4]
<strong>Output:</strong> [2,1,4,3]
</pre>
<p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> head = []
<strong>Output:</strong> []
</pre>
<p><strong class="example">Example 3:</strong></p>
<pre><strong>Input:</strong> head = [1]
<strong>Output:</strong> [1]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>
<ul>
<li>The number of nodes in the&nbsp;list&nbsp;is in the range <code>[0, 100]</code>.</li>
<li><code>0 &lt;= Node.val &lt;= 100</code></li>
</ul>
</div>