Two words to express it, brief yet powerful！

发布于 几秒前0递归算法链表

解题思路

此处撰写解题思路

代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public static ListNode swapPairs(ListNode head) {
    	if(head==null||head.next==null) {
    		return head;
    	}
    	ListNode next = head.next;
    	head.next = swapPairs(next.next);
        next.next = head;
    	return next;
    }
}

标签：head,ListNode,val,int,powerful,express,list,next
来源： https://blog.csdn.net/qq_32662795/article/details/112725818