DS顺序表--合并操作

最新推荐文章于 2023-09-22 10:18:01 发布

Littlsecr

最新推荐文章于 2023-09-22 10:18:01 发布

阅读量1.2k

点赞数 1

分类专栏：数据结构上机文章标签：顺序表

本文链接：https://blog.csdn.net/Littlsecr/article/details/82427911

版权

数据结构上机专栏收录该内容

12 篇文章 6 订阅

订阅专栏

#include<iostream>
using namespace std;
 
// 顺序表类定义
class seqlist
{
private:
    int *list;
    int maxsize;
    int size;
public:
    seqlist()
    {
        maxsize = 1000;
        size = 0;
        list = new int [maxsize];
    }
    ~seqlist()
    {
        delete []list;
    }
    void creat(int *p, int size_num)
    {
        int i;
        size = size_num;
        for(i = 0; i < size; i++)
        {
            list[i] = p[i];
        }
    }
    int list_size()
    {
        return size;
    }
    void display()
    {
        int i;
        cout << list_size()<< " ";
        for(i =0 ; i < size; i++)
            cout << list[i] << " ";
        cout << endl;
    }
    void mix(const seqlist &r1, const seqlist &r2)
    {
        int i, j = 0, k = 0;
        int size_p = r2.size;
        size = r1.size + r2.size;
        int *p = new int [r2.size];
        for(i = 0; i < r2.size; i++)
            p[i] = r2.list[i];
        for(i = 0; i < r1.size; i++)
        {
            if(r1.list[i] < p[k])
            {
                list[j] = r1.list[i];
                j++;
                continue;
            }
            else
            {
                list[j] = p[k];
                j++;
                k++;
                i--;
                size_p--;
            }
            if(size_p == 0)
            {
                i++;
                for(; i < r1.size; i++, j++)
                {
                    list[j] = r1.list[i];
                }
                break;
            }
        }
        if(size_p != 0)
        {
            for(i = 0; i < size_p; i++, j++)
            {
                list[j] = p[i+k];
            }
        }
    }
};
 
int main()
{
    int size, i;
    cin >> size;
    seqlist a;
    int *arr1 = new int [size];
    for(i = 0; i < size; i++)
    {
        cin >> arr1[i];
    }
    a.creat(arr1, size);
    delete []arr1;
 
    cin >> size;
    seqlist b;
    int *arr2 = new int [size];
    for(i = 0; i < size; i++)
    {
        cin >> arr2[i];
    }
    b.creat(arr2, size);
    delete []arr2;
    seqlist c;
    c.mix(a,b);
    c.display();
    return 0;
}