import java.util.Objects; class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if (Objects.isNull(l1)) { return l2; } if (Objects.isNull(l2)) { return l1; } ListNode root = null; ListNode pre = null; while (Objects.nonNull(l1) && Objects.nonNull(l2)) { if (l1.val < l2.val) { if (Objects.isNull(root)) { root = l1; } else { pre.next = l1; } pre = l1; l1 = l1.next; } else { if (Objects.isNull(root)) { root = l2; } else { pre.next = l2; } pre = l2; l2 = l2.next; } } if (Objects.nonNull(l1)) { pre.next = l1; } if (Objects.nonNull(l2)) { pre.next = l2; } return root; } }
LeetCode - 21. 合并两个有序链表
猜你喜欢
转载自blog.51cto.com/tianyiya/2172722
今日推荐
周排行