递增量表的创建、合并、打印
1、链表节点类
public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } }
2、链表合并类
public class ListMerge { public ListNode merge(ListNode list1, ListNode list2) { ListNode head = null; if (list1 == null) { return list2; } if (list2 == null) { return list1; } //递归调用 if (list1.val < list2.val) { head = list1; head.next = merge(list1.next, list2); } else { head = list2; head.next = merge(list1, list2.next); } return head; } }