zoukankan      html  css  js  c++  java
  • leetcode:Merge Two Sorted Lists

    1、

      Merge two sorted (ascending) linked lists and return it as a new sorted list.

      The new sorted list should be made by splicing together the nodes of the two lists and sorted in ascending order.

    Given 1->3->8->11->15->null2->null , return 1->2->3->8->11->15->null.

    2、思路

      1、判断两数大小,小的话,插入

    3、

      

    /**
     * Definition for ListNode.
     * public class ListNode {
     *     int val;
     *     ListNode next;
     *     ListNode(int val) {
     *         this.val = val;
     *         this.next = null;
     *     }
     * }
     */ 
    public class Solution {
        /**
         * @param ListNode l1 is the head of the linked list
         * @param ListNode l2 is the head of the linked list
         * @return: ListNode head of linked list
         */
        public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
            ListNode dumary = new ListNode(0);
             //赋值
             ListNode lastNode = dumary;
             while(l1 != null && l2 != null){
                 if(l1.val > l2.val){
                     lastNode.next = l2;
                     l2 = l2.next;
                 }else{
                     lastNode.next = l1;
                     l1 = l1.next;
                 }
                 lastNode = lastNode.next;
             }
             if(l1 != null){
                 lastNode.next = l1;
             }else{
                 lastNode.next = l2;
             }
         return dumary.next;
        }
    }
    工作小总结,有错请指出,谢谢。
  • 相关阅读:
    删除指定字符
    Palindromes _easy version
    统计元音
    查找最大元素
    首字母变大写
    Intent加强
    GUI_键盘事件
    GUI_鼠标事件
    GUI_事件监听机制与ActionListener演示
    GUI概述与Frame演示
  • 原文地址:https://www.cnblogs.com/zilanghuo/p/5329492.html
Copyright © 2011-2022 走看看