zoukankan      html  css  js  c++  java
  • Leetcode 之 Merge Two Sorted Lists

    C++代码

    /**
     * Definition for singly-linked list.
     * struct ListNode {
     *     int val;
     *     ListNode *next;
     *     ListNode(int x) : val(x), next(NULL) {}
     * };
     */
    class Solution {
    public:
        ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
            if (nullptr == l1) return l2;
            if (nullptr == l2) return l1;
            ListNode* ret;
            if (l1->val < l2->val) {
                ret = l1;
                l1 = l1->next;
            } else {
                ret = l2;
                l2 = l2->next;
            }
            ListNode* cur = ret;
            while (nullptr != l1 && nullptr != l2) {
                if (l1->val < l2->val) {
                    cur->next = l1;
                    l1 = l1->next;
                } else {
                    cur->next = l2;
                    l2 = l2->next;
                }
                cur = cur->next;
            }
            if (nullptr != l1) cur->next = l1;
            if (nullptr != l2) cur->next = l2;
            return ret;
        }
    };
  • 相关阅读:
    C# 应用
    WPF 应用
    WPF 应用
    WPF 应用
    WPF 基础
    WPF 基础
    WPF 应用
    WPF 应用
    下厨房
    买苹果
  • 原文地址:https://www.cnblogs.com/Dream-Fish/p/4743190.html
Copyright © 2011-2022 走看看