From 716639f69e0bdccf63b4c83d1b5271798434e225 Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Mon, 7 Jun 2021 11:26:39 +0800 Subject: [PATCH] =?UTF-8?q?1669:=E5=90=88=E5=B9=B6=E4=B8=A4=E4=B8=AA?= =?UTF-8?q?=E9=93=BE=E8=A1=A8?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../editor/cn/MergeInBetweenLinkedLists.java | 93 +++++++++++++++++++ .../editor/cn/MergeInBetweenLinkedLists.md | 38 ++++++++ 2 files changed, 131 insertions(+) create mode 100644 src/main/java/leetcode/editor/cn/MergeInBetweenLinkedLists.java create mode 100644 src/main/java/leetcode/editor/cn/MergeInBetweenLinkedLists.md diff --git a/src/main/java/leetcode/editor/cn/MergeInBetweenLinkedLists.java b/src/main/java/leetcode/editor/cn/MergeInBetweenLinkedLists.java new file mode 100644 index 0000000..81a3927 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/MergeInBetweenLinkedLists.java @@ -0,0 +1,93 @@ +//给你两个链表 list1 和 list2 ，它们包含的元素分别为 n 个和 m 个。 +// +// 请你将 list1 中第 a 个节点到第 b 个节点删除，并将list2 接在被删除节点的位置。 +// +// 下图中蓝色边和节点展示了操作后的结果： +// +// 请你返回结果链表的头指针。 +// +// +// +// 示例 1： +// +// +// +// +//输入：list1 = [0,1,2,3,4,5], a = 3, b = 4, list2 = [1000000,1000001,1000002] +//输出：[0,1,2,1000000,1000001,1000002,5] +//解释：我们删除 list1 中第三和第四个节点，并将 list2 接在该位置。上图中蓝色的边和节点为答案链表。 +// +// +// 示例 2： +// +// +//输入：list1 = [0,1,2,3,4,5,6], a = 2, b = 5, list2 = [1000000,1000001,1000002,100 +//0003,1000004] +//输出：[0,1,1000000,1000001,1000002,1000003,1000004,6] +//解释：上图中蓝色的边和节点为答案链表。 +// +// +// +// +// 提示： +// +// +// 3 <= list1.length <= 104 +// 1 <= a <= b < list1.length - 1 +// 1 <= list2.length <= 104 +// +// Related Topics 链表 +// 👍 15 👎 0 + +package leetcode.editor.cn; + +import com.code.leet.entiy.ListNode; + +//1669:合并两个链表 +public class MergeInBetweenLinkedLists { + public static void main(String[] args) { + //测试代码 + Solution solution = new MergeInBetweenLinkedLists().new Solution(); + } + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + + /** + * 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 ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) { + ListNode temp = list1; + int num = 0; + while (temp != null) { + ListNode trans = new ListNode(0); + if (num == a - 1) { + trans.next = temp.next; + temp.next = list2; + temp = trans; + } + if (num == b + 1) { + ListNode temp2 = list2; + while (temp2 != null && temp2.next != null) { + temp2 = temp2.next; + } + assert temp2 != null; + temp2.next = temp; + break; + } + num++; + temp = temp.next; + } + return list1; + } + } +//leetcode submit region end(Prohibit modification and deletion) + +} \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/MergeInBetweenLinkedLists.md b/src/main/java/leetcode/editor/cn/MergeInBetweenLinkedLists.md new file mode 100644 index 0000000..947ea01 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/MergeInBetweenLinkedLists.md @@ -0,0 +1,38 @@ +

给你两个链表 list1 和 list2 ，它们包含的元素分别为 n 个和 m 个。

+ +

请你将 list1 中第 a 个节点到第 b 个节点删除，并将list2 接在被删除节点的位置。

+ +

下图中蓝色边和节点展示了操作后的结果：

+ +

请你返回结果链表的头指针。

+ +

 

+ +

示例 1：

+ +

+ +
+输入：list1 = [0,1,2,3,4,5], a = 3, b = 4, list2 = [1000000,1000001,1000002]
+输出：[0,1,2,1000000,1000001,1000002,5]
+解释：我们删除 list1 中第三和第四个节点，并将 list2 接在该位置。上图中蓝色的边和节点为答案链表。
+
+ +

示例 2：

+ +
+输入：list1 = [0,1,2,3,4,5,6], a = 2, b = 5, list2 = [1000000,1000001,1000002,1000003,1000004]
+输出：[0,1,1000000,1000001,1000002,1000003,1000004,6]
+解释：上图中蓝色的边和节点为答案链表。
+
+ +

 

+ +

提示：

+ + +
Related Topics
  • 链表
    • \n
  • 👍 15
  • 👎 0
    • \ No newline at end of file