Leetcode 21 Merge Two Sorted Lists

来源:互联网 发布:马东眼袋在哪割的 知乎 编辑:程序博客网 时间:2024/06/05 23:43

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.

基本的递归做法。注意null的检查

/** * Definition for singly-linked list. * public class ListNode { *     int val; *     ListNode next; *     ListNode(int x) { val = x; } * } */public class Solution {    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {                if(l1==null)        return l2;        if(l2==null)        return l1;            if(l1.val < l2.val){        l1.next = mergeTwoLists(l1.next,l2);        return l1;    }else{         l2.next = mergeTwoLists(l2.next,l1);         return l2;    }    }}


0 0