关闭

21. Merge Two Sorted Lists

82人阅读 评论(0) 收藏 举报
分类:

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.

/**
 * 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) {
       ListNode p1 = l1;
       ListNode p2 = l2;
       ListNode presult = new ListNode(0);
       ListNode p = presult;
       
       while(p1 != null && p2 != null){
           if(p1.val >= p2.val){
               p.next = p2;
               p2 = p2.next;
           }else{
               p.next = p1;
               p1 = p1.next;
           }
           p = p.next;
       }
       if(p1 != null){
           p.next = p1;
       }
       if(p2 != null){
           p.next = p2;
       }
       
       return presult.next;
      }
    }


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:71861次
    • 积分:1472
    • 等级:
    • 排名:千里之外
    • 原创:79篇
    • 转载:9篇
    • 译文:0篇
    • 评论:13条
    最新评论