zoukankan      html  css  js  c++  java
  • [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.

    代码:

    import java.util.List;
    
    
    public class Merge_Two_Sorted_Lists {  //java
    
    	  public class ListNode {
    	      int val;
    	      ListNode next;
    	      ListNode(int x) {
    	          val = x;
    	          next = null;
    	      }
    	  }
    	 
    	
        public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
            if(l2 == null)
            	return l1;
            if(l1 == null)
            	return l2;
            
            ListNode tmp1 = l1;
            ListNode tmp2 = l2;
            ListNode head = new ListNode(0);
            ListNode result = head;
            while(tmp1 != null && tmp2 != null){
            	if(tmp1.val > tmp2.val){
            		ListNode node = new ListNode(tmp2.val);
            		result.next = node;
            		result = result.next;
            		tmp2 = tmp2.next;
            	}
            	
            	else{
            		ListNode node = new ListNode(tmp1.val);
            		result.next = node;
            		result = result.next;
            		tmp1 = tmp1.next;
            	}
            }
            
            if(tmp2 == null)
            	result.next = tmp1;
            else result.next = tmp2;
            
            return head.next;
            	
        }
    
    }
    


  • 相关阅读:
    Design + Code (iOS)
    Objective-C Programming (2nd Edition)
    iOS Programming The Big Nerd Ranch Guide (4th Edition)
    反射
    面向对象
    人狗大战
    数据结构初识(三级菜单)
    面向对象(组合)
    练习
    re模块
  • 原文地址:https://www.cnblogs.com/mthoutai/p/6783451.html
Copyright © 2011-2022 走看看