Shulou(Shulou.com)05/31 Report--

This article mainly explains "how to achieve pairwise switching nodes in Java". Friends who are interested may wish to have a look. The method introduced in this paper is simple, fast and practical. Let's let the editor take you to learn "how to achieve pairwise switching nodes with Java".

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-> 3public class SwapPairs {public static void main (String [] args) {ListNode L1 = new ListNode (1); ListNode N1 = new ListNode (3); ListNode N2 = new ListNode (4); l1.next = N1; n1.next = N2; SwapPairs sp = new SwapPairs () ListNode head = sp.swapPairs (L1); System.out.println (head.val); System.out.println (head.next.val); System.out.println (head.next.next.val);} ListNode swapPairs (ListNode head) {if (head = = null | | head.next = = null) return head; ListNode first = head; ListNode last = head.next First.next = swapPairs (last.next); / / Recursive thought is very important last.next = first; return last;}} at this point, I believe you have a better understanding of "how to achieve pairwise switching nodes in Java". You might as well do it in practice. Here is the website, more related content can enter the relevant channels to inquire, follow us, continue to learn!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.