深圳技术大学oj-顺序表

1. 

#include <bits/stdc++.h>
using namespace std;
class seqlist
{
private:
    int* list;
    int maxsize;
    int size;
public:
    seqlist();
    ~seqlist();
    int list_size();
    int list_insert(int i, int item);
    int list_del(int i);
    void list_get(int i);
    void list_display();
};
seqlist::seqlist()
{
    maxsize = 1000;
    size = 0;
    list = new int[maxsize];
}
seqlist::~seqlist()
{
    delete []list;
}
int seqlist::list_insert(int i, int it)
{
    if (i < 0 || i > size || size >= maxsize)
    {
        return 0;
    }
    for (int j = size; j > i; j--)
    {
        list[j] = list[j - 1];
    }
    list[i] = it;
    size++;
    return 1;
}
void seqlist::list_get(int i)
{
    if (i <= 0 || i > size)
    {
        cout << "error" << '\n';
    }
    else
    {
        cout << list[i - 1] << '\n';
    }
}
int seqlist::list_del(int i)
{
    if (i < 0 || i >= size)
    {
        return 0;
    }
    for (int j = i; j < size; j++)
    {
        list[j] = list[j + 1];
    }
    size--;
    return 1;
}
void seqlist::list_display()
{
    cout << size << " ";
    for (int i = 0; i < size; i++)
    {
        cout << list[i] << " ";
    }
    cout << '\n';
}
//返回0可以打印error
int main()
{
    int n;
    cin >> n;
    seqlist s;
    for (int i = 0; i < n; i++)
    {
        int it;
        cin >> it;
        s.list_insert(i, it);
    }
    s.list_display();
    int value;
    int index;
    cin >> index >> value;
    if (s.list_insert(index - 1, value))
    {
        s.list_display();
    }
    else
    {
        cout << "error" << '\n';
    }
    cin >> index >> value;
    if (s.list_insert(index - 1, value))
    {
        s.list_display();
    }
    else
    {
        cout << "error" << '\n';
    }
    cin >> index;
    if (s.list_del(index - 1))
    {
        s.list_display();
    }
    else
    {
        cout << "error" << '\n';
    }
    cin >> index;
    if (s.list_del(index - 1))
    {
        s.list_display();
    }
    else
    {
        cout << "error" << '\n';
    }


    cin >> index;
    s.list_get(index);
    cin >> index;
    s.list_get(index);
    return 0;
}

 2.

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
using namespace std;
class Data
{
	int num[1000];
	int  length;
	int max_length;
public:
	void get()
	{
		max_length = 1000;
		cin >> length;
		for (int i = 0; i < length; i++)
		{
			cin >> num[i];
		}
	}
	void display()
	{
		cout << length<<" ";
		for (int i = 0; i < length; i++)
		{
			cout << num[i];
			cout << " ";
			
		}cout << endl;
	}
	void multiinsert(int i, int n, int item[])
	{
		length = length + n;
		for (int j = length; j >=i-1+n; j--)
		{
			
			num[j] = num[j - 3];
		}
		for (int j = i - 1,a=0; j < (i - 1 + n); j++,a++)
		{
			num[j] = item[a];
		}
	}
	void multidel(int i, int n)
	{
		length = length - n;
		for (int j = i - 1; j < length; j++)
		{
			num[j] = num[j + n];
		}
	}
	
};
int main()
{
	Data obj;
	obj.get();
	obj.display();
	int a;
	int b;
	int item[1000];
	cin >> a >> b;
	for (int i = 0; i < b; i++)
	{
		cin >> item[i];
	}
	obj.multiinsert(a, b, item);
	obj.display();
	int x;
	int y;
	cin >> x >> y;
	obj.multidel(x, y);
	obj.display();
	return 0;
}

 3.

#include <bits/stdc++.h>
using namespace std;
class seqlist
{
private:
    int* list;
    int maxsize;
    int size;
public:
    seqlist();
    ~seqlist();
    int list_insert(int i, int item);
    int list_del(int i);
    void list_get(int i);
    void list_display();
    void merge(seqlist& other);
};
void seqlist::merge(seqlist& other)
{
    int* temp = new int[size + other.size];
    int i = 0, j = 0, k = 0;

    while (i < size && j < other.size) {
        if (list[i] < other.list[j]) {
            if (k == 0 || temp[k - 1] != list[i]) {
                temp[k++] = list[i];
            }
            i++;
        }
        else if (list[i] > other.list[j]) {
            if (k == 0 || temp[k - 1] != other.list[j]) {
                temp[k++] = other.list[j];
            }
            j++;
        }
        else {
            if (k == 0 || temp[k - 1] != list[i]) {
                temp[k++] = list[i];
            }
            i++;
            j++;
        }
    }

    while (i < size) {
        if (k == 0 || temp[k - 1] != list[i]) {
            temp[k++] = list[i];
        }
        i++;
    }

    while (j < other.size) {
        if (k == 0 || temp[k - 1] != other.list[j]) {
            temp[k++] = other.list[j];
        }
        j++;
    }

    delete[] list;
    list = temp;
    size = k;
}
seqlist::seqlist()
{
    maxsize = 1000;
    size = 0;
    list = new int[maxsize];
}
seqlist::~seqlist()
{
    delete[]list;
}
int seqlist::list_insert(int i, int it)
{
    if (i < 0 || i > size || size >= maxsize)
    {
        return 0;
    }
    for (int j = size; j > i; j--)
    {
        list[j] = list[j - 1];
    }
    list[i] = it;
    size++;
    return 1;
}
void seqlist::list_get(int i)
{
    if (i <= 0 || i > size)
    {
        cout << "error" << '\n';
    }
    else
    {
        cout << list[i - 1] << '\n';
    }
}
int seqlist::list_del(int i)
{
    if (i < 0 || i >= size)
    {
        return 0;
    }
    for (int j = i; j < size; j++)
    {
        list[j] = list[j + 1];
    }
    size--;
    return 1;
}
void seqlist::list_display()
{
    cout << size << " ";
    for (int i = 0; i < size; i++)
    {
        cout << list[i] << " ";
    }
    cout << '\n';
}

int main()
{
    int n;
    cin >> n;
    seqlist s;
    seqlist v;
    for (int i = 0; i < n; i++)
    {
        int it;
        cin >> it;
        s.list_insert(i, it);
    }
    int k;
    cin >> k;
    for (int i = 0; i < k; i++)
    {
        int it;
        cin >> it;
        v.list_insert(i, it);
    }
    s.merge(v);
    s.list_display();
    return 0;
}

 4.

#include <iostream>
using namespace std;
class Data
{int num[1000];
	int  length;
	int max_length;
 
public:
	
	void get()
	{
		max_length = 1000;
		cin >> length;
		for (int i = 0; i < length; i++)
		{
			cin >> num[i];
		}
	}
	void display()
	{
 
		for (int i = 0; i < length; i++)
		{
			cout << num[i];
			cout << " ";
			
		}cout << endl;
	}
	void left(int n)
	{
		for (int i = n ; i < length; i++)
		{
			cout << num[i] << " ";
		}
		for (int i = 0; i < n; i++)
		{
			cout << num[i] << " ";
		}
		cout << endl;
	}
	void right(int n)
	{
		for (int i = length-n+2; i < length; i++)
		{
			cout << num[i] << " ";
		}
		for (int i = 0; i < length-n+2; i++)
		{
			cout << num[i] << " ";
		}
		cout << endl;
	}
	
};
int main()
{
	Data obj;
	obj.get();
	obj.display();
	int x;
	int a;
	cin >> x>>a;
	if (x == 0)
		obj.left(a);
	else
		obj.right(a);
	int y;
	int b;
	cin >> y>>b;
	if(y==0)
		obj.left(b);
	else
		obj.right(b);
	
	return 0;
}

 5.

#include <bits/stdc++.h>
#define ok 0
#define error -1
using namespace std;
 
void outint(int n){cout<<n<<" ";}
int main()
{
    vector<int> v(1000,0),v1(1000,0);
    int n,n1,n2;
    int flag=1;
    cin>>n;
    while(n>0){
    flag=1;
    v=v1=vector<int>(1000,0);
    cin>>n1;
    int t1,t2;
    for(int i=0;i<n1;i++)
    {
        cin>>t1>>t2;
        v[500+t2]=t1;
    }
    for(int i=0;i<1000;i++)
    {
        if(v[i]==0)
            continue;
        else
        {
            if(flag==1)
                flag=0;
            else
                cout<<" + ";
            if(i==500){
                if(v[500]>0)
                    {cout<<v[500];}
                else
                    cout<<"("<<v[500]<<")";
            }
            if(i<500){
                if(v[i]>0)
                    {cout<<v[i]<<"x^("<<(i-500)<<")";}
                else
                    cout<<"("<<v[i]<<")"<<"x^("<<(i-500)<<")";
            }
            if(i>500){
                if(v[i]>0)
                    {cout<<v[i]<<"x^"<<i-500;}
                else
                    cout<<"("<<v[i]<<")"<<"x^"<<i-500;
            }
        }
    }
    cout<<endl;
 
    cin>>n2;
    flag=1;
    for(int i=0;i<n2;i++)
    {
        cin>>t1>>t2;
        v1[500+t2]=t1;
    }
    for(int i=0;i<1000;i++)
    {
        if(v1[i]==0)
            continue;
        else
        {
            if(flag==1)
                flag=0;
            else
                cout<<" + ";
            if(i==500){
                if(v1[500]>0)
                    {cout<<v1[500];}
                else
                    cout<<"("<<v1[500]<<")";
            }
            if(i<500){
                if(v1[i]>0)
                    {cout<<v1[i]<<"x^("<<(i-500)<<")";}
                else
                    cout<<"("<<v1[i]<<")"<<"x^("<<(i-500)<<")";
            }
            if(i>500){
                if(v1[i]>0)
                    {cout<<v1[i]<<"x^"<<i-500;}
                else
                    cout<<"("<<v1[i]<<")"<<"x^"<<i-500;
            }
 
        }
    }
    cout<<endl;
 
    for(int i=0;i<1000;i++)
    {
        v[i]+=v1[i];
    }
    flag=1;
    for(int i=0;i<1000;i++)
    {
        if(v[i]==0)
            continue;
        else
        {
            if(flag==1)
                flag=0;
            else
                cout<<" + ";
            if(i==500){
                if(v[500]>0)
                    {cout<<v[500];}
                else
                    cout<<"("<<v[500]<<")";
            }
            if(i<500){
                if(v[i]>0)
                    {cout<<v[i]<<"x^("<<(i-500)<<")";}
                else
                    cout<<"("<<v[i]<<")"<<"x^("<<(i-500)<<")";
            }
            if(i>500){
                if(v[i]>0)
                    {cout<<v[i]<<"x^"<<i-500;}
                else
                    cout<<"("<<v[i]<<")"<<"x^"<<i-500;
            }
 
        }
    }
    cout<<endl;
    n--;
    }
}