合并两个排好序的链表(c++)

#include<iostream>

struct node{
    int payload;
    node* next;
    node(int payload){this->payload=payload;next=nullptr;}
};

void bianli(node* head){
  node* iterator = head;
  while(iterator){
    std::cout << iterator->payload << " ";
    iterator = iterator->next;
  }
  std::cout<<" "<<std::endl;
}

class linkedlist{
    node* head,*tail;
public:
    linkedlist():head(nullptr),tail(nullptr){};
    void push_back(int value){
        if(empty()){
            head = tail = new node(value);
        }else{
            tail->next = new node(value);
            tail = tail->next;
        }
    }

    int front(){
        if(empty()){
            throw "The list is empty";
        }
        return head->payload;
    }
    void pop_front(){
        if(empty()){
            throw "The list is empty";
        }
        node* first_node = head;
        head = head->next;
        delete first_node;
    }
    bool empty(){
        return head==nullptr;
    }
    void output(){
        node* iterator = head;
        while(iterator){
            std::cout << iterator->payload << " ";
            iterator = iterator->next;
        }
        std::cout << std::endl;
    }
};

linkedlist merge(linkedlist a,linkedlist b){
    linkedlist result ;
    while(!a.empty() || !b.empty()){
        if(a.empty()){
            result.push_back(b.front());
            b.pop_front();
        }else if(b.empty()){
            result.push_back(a.front());
            a.pop_front();
        }else if(a.front() > b.front()){
            result.push_back(b.front());
            b.pop_front();
        }else{
            result.push_back(a.front());
            a.pop_front();
        }
    }
    return result;
}

int main(){

    linkedlist a,b;
    a.push_back(4);
    a.push_back(7);
    a.push_back(20);
    a.push_back(21);

    b.push_back(2);
    b.push_back(3);
    b.push_back(5);
    b.push_back(9);
    b.push_back(29);
    b.push_back(40);

    linkedlist result = merge(a,b);
    result.output();
    system("pause");
    return 0;
}

 

转载于:https://www.cnblogs.com/zychengzhiit1/p/5795102.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值