JAVA_Merge Two Sorted Lists_LeetCode 21

JAVA_Merge Two Sorted Lists_LeetCode 21 Merge Two Sorted Lists 풀이 /** * 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 mergeTwoLists(ListNode list1, ListNode list2) { if (list1 == null || list2 == null) return list1 == null ? list2 : list1; if (list1.val > list2.val) return mergeTwoLists(...

원문링크 : JAVA_Merge Two Sorted Lists_LeetCode 21