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. Solution 1: public class Solution { public ListNode swapPairs(ListNode head) { if(head == null || head.next == null) return…… Continue reading Leetcode 24 Swap Nodes in Pairs Java Solution