码迷,mamicode.com
首页 > 编程语言 > 详细

Java for LeetCode 021 Merge Two Sorted Lists

时间:2015-05-03 13:18:58      阅读:134      评论:0      收藏: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.
解题思路:
新建一个ListNode进行存储即可,JAVA实现如下:
	static public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
		ListNode listnode=new ListNode(0);
		ListNode index=listnode;
		while(l1!=null&&l2!=null){
			if(l1.val>l2.val){
				ListNode temp=l1;
				l1=l2;
				l2=temp;
			}
			index.next=new ListNode(l1.val);
			index=index.next;
			l1=l1.next;
		}
		if(l1==null)
			index.next=l2;
		else 
			index.next=l1;
		return listnode.next;
	}

 

Java for LeetCode 021 Merge Two Sorted Lists

标签:

原文地址:http://www.cnblogs.com/tonyluis/p/4473537.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!