首页 > 代码库 > LeetCode--Merge Two Sorted Lists
LeetCode--Merge Two Sorted Lists
题目:
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; * next = null; * } * } */ public class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode lr=new ListNode(0); ListNode temp=lr; if(l1==null){ return l2; } if(l2==null){ return l1; } while(l1!=null||l2!=null){ boolean isl1=true; if(l1!=null&&l2!=null){ if(l1.val>=l2.val){ isl1=false; } }else if(l1==null){ isl1=false; } if(isl1){ temp.next=l1; l1=l1.next; }else{ temp.next=l2; l2=l2.next; } temp=temp.next; } return lr.next; } }
LeetCode--Merge Two Sorted Lists
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。