From 65711b20d8369568f19c9ea6d1d07e5804f1f147 Mon Sep 17 00:00:00 2001
From: Yucheng Hu <yuchenghu@ossez.com>
Date: Sat, 15 Dec 2018 20:53:24 -0500
Subject: [PATCH] =?UTF-8?q?=E9=A2=98=E7=9B=AE=E7=BC=96=E5=8F=B7=20165?=
 =?UTF-8?q?=EF=BC=8C=E5=90=88=E5=B9=B6=202=20=E4=B8=AA=E6=9C=89=E5=BA=8F?=
 =?UTF-8?q?=E9=93=BE=E8=A1=A8?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../LintCode0165MergeTwoListsTest.java        | 89 +++++++++++++++++++
 1 file changed, 89 insertions(+)
 create mode 100644 src/test/java/com/ossez/lang/tutorial/tests/lintcode/LintCode0165MergeTwoListsTest.java

diff --git a/src/test/java/com/ossez/lang/tutorial/tests/lintcode/LintCode0165MergeTwoListsTest.java b/src/test/java/com/ossez/lang/tutorial/tests/lintcode/LintCode0165MergeTwoListsTest.java
new file mode 100644
index 0000000000..5bfac549d6
--- /dev/null
+++ b/src/test/java/com/ossez/lang/tutorial/tests/lintcode/LintCode0165MergeTwoListsTest.java
@@ -0,0 +1,89 @@
+package com.ossez.lang.tutorial.tests.lintcode;
+
+import org.junit.Test;
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+import com.ossez.lang.tutorial.models.ListNode;
+
+/**
+ * <p>
+ * 102
+ * <ul>
+ * <li>@see <a href=
+ * "https://www.cwiki.us/display/ITCLASSIFICATION/Linked+List+Cycle">https://www.cwiki.us/display/ITCLASSIFICATION/Linked+List+Cycle</a>
+ * <li>@see<a href= "https://www.lintcode.com/problem/linked-list-cycle/">https://www.lintcode.com/problem/linked-list-cycle/</a>
+ * </ul>
+ * </p>
+ * 
+ * @author YuCheng
+ *
+ */
+public class LintCode0165MergeTwoListsTest {
+
+	private final static Logger logger = LoggerFactory.getLogger(LintCode0165MergeTwoListsTest.class);
+
+	/**
+	 * 
+	 */
+	@Test
+	public void testMain() {
+		logger.debug("BEGIN");
+		// INIT LINKED LIST l1
+		ListNode l1 = new ListNode(1);
+		l1.next = new ListNode(3);
+		l1.next.next = new ListNode(8);
+		l1.next.next.next = new ListNode(11);
+		l1.next.next.next.next = new ListNode(15);
+
+		// INIT LINKED LIST l2
+		ListNode l2 = new ListNode(2);
+
+		// RETURN RESULT
+		ListNode retResult = new ListNode(0);
+
+		// NULL CHECK
+		// if (l1 == null && l2 == null) {
+		// retResult = null;
+		// }
+		//
+		// if (l1 == null) {
+		// retResult = l2;
+		// }
+		//
+		// if (l2 == null) {
+		// retResult = l1;
+		// }
+
+		// MERGE
+		retResult = new ListNode(0);
+		ListNode tmpNode = new ListNode(0);
+		retResult = tmpNode;
+		while (l1 != null & l2 != null) {
+			if (l1.val <= l2.val) {
+				tmpNode.next = l1;
+				l1 = l1.next;
+			} else {
+				tmpNode.next = l2;
+				l2 = l2.next;
+			}
+
+			tmpNode = tmpNode.next;
+		}
+
+		if (l1 == null) {
+			tmpNode.next = l2;
+		}
+
+		if (l2 == null) {
+			tmpNode.next = l1;
+		}
+
+		retResult = retResult.next;
+
+		System.out.println(retResult.val);
+		System.out.println(retResult.next.val);
+		System.out.println(retResult.next.next.val);
+
+	}
+}