leetcode解题之21# Merge Two Sorted Lists Java版递归和非递归实现

最新推荐文章于 2022-04-25 19:49:06 发布

原创最新推荐文章于 2022-04-25 19:49:06 发布 · 1k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#java #leetcode #递归 #合并

收录于

leetcode 专栏收录该内容

155 篇文章

订阅专栏

本文介绍了一种将两个已排序的链表合并为一个新排序链表的方法。提供了两种实现方式：非递归方法通过遍历两个链表并比较节点值来合并；递归方法则通过比较当前节点值，选择较小值作为新链表节点，并递归地处理剩余部分。

21. Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

	// 非递归实现
	public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
		ListNode head = new ListNode(0);
		ListNode cur = head;
		while (l1 != null && l2 != null) {
			if (l1.val >= l2.val) {
				cur.next = l2;
				l2 = l2.next;
			} else {
				cur.next = l1;
				l1 = l1.next;
			}
			cur = cur.next;
		}

		if (l1 != null)
			cur.next = l1;
		if (l2 != null)
			cur.next = l2;
		return head.next;
	}

	// 递归实现
	public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
		ListNode res = null;
		if (l1 == null)
			return l2;
		if (l2 == null)
			return l1;
		if (l1.val <= l2.val) {
			res = l1;
			l1.next = mergeTwoLists(l1.next, l2);
		} else {
			res = l2;
			l2.next = mergeTwoLists(l1, l2.next);
		}
		return res;
	}