数据结构.pta测试1

#include<iostream>
using namespace std;
const int N = 1000;
typedef struct ListNode {
    int data[N];
    int length;
}*SqList;
SqList Init()
{
    SqList L;
    L = (SqList)malloc(sizeof(ListNode));
    L->length = 0;
    return L;
}
int Insert(SqList L, int i, int data)
{
    if (L->length == N || i<1 || i>L->length+1 )return 0;
    for (int k = L->length - 1; k >= i - 1; k--)
    {
        L->data[k + 1] = L->data[k];
    }
    L->data[i - 1] = data;
    L->length++;
    return 1;

}
int Delete(SqList L, int i)
{
    if (L->length == 0 || i<1 || i>L->length)return 0;
    for (int k = i; k < L->length; k++)
    {
        L->data[k - 1] = L->data[k];
    }
    L->length--;
    return 1;
}
void Ans(SqList L, int x, int y)
{
    for (int i = 0; i < L->length; i++)
    {
        if (L->data[i] >= x && L->data[i] <= y)
        {
            Delete(L, i + 1);
            i--;
        }
    }
}

void OutPut(SqList L)
{
    for (int i = 0; i < L->length - 1; i++)
    {
        cout << L->data[i] << " ";
    }
    cout << L->data[L->length-1];


}
int main()
{
    SqList L = Init();
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int data;
        cin >> data;
        Insert(L, i, data);
    }
    int x, y;
    cin >> x >> y;
    Ans(L, x, y);
    OutPut(L);


    return 0;
}

#include<iostream>
using namespace std;
const int N = 104;
int a[N], b[N],c[N],k;
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++)cin >> a[i];
    for (int i = 0; i < m; i++)cin >> b[i];
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (a[i] == b[j])c[k++] = a[i];
        }
    }
    if (k == 0)
    {
        cout << "NULL";
        return 0;
    }
    for (int i = 0; i < k-1; i++)cout << c[i]<<" ";
    cout << c[k - 1];

    return 0;
}

#include<iostream>
using namespace std;
const int N = 15;
typedef struct ListNode {
    int data[N];
    int length;
}*SqList;
SqList Init()
{
    SqList L;
    L = (SqList)malloc(sizeof(ListNode));
    L->length = 0;
    return L;
}
int Insert(SqList L, int i, int data)
{
    if (L->length == N || i < 0||i>L->length)return 0;
    L->data[i] = data;
    L->length++;
    return 0;
}
void OutPut(SqList L)
{
    cout << "(";
    for (int i = 0; i < L->length-1; i++)
    {
         cout  << L->data[i]<<"," ;
    }
    cout << L->data[L->length - 1]<<")";
}
int Delete(SqList L,int index)
{
    if (index<1 || index>L->length )
    {
        cout << "Delete position error!"; exit(0);
        return 0;
    }
    for (int i = index-1; i < L->length-1; i++)
    {
        L->data[i] = L->data[i + 1];
       
    }
    L->length--;
    return 0;
}
SqList Copy(SqList LL, SqList L,int len)
{
    for (int i = 0; i < len; i++)
    {
        LL->data[i] = L->data[i];
        LL->length++;
    }
    return LL;
}
int main()
{
    SqList L = Init();
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int data;
        cin >> data;
        Insert(L,i,data);
    }
    SqList LL= Init();
    Copy(LL, L,L->length);
    int index;
   
    cin >> index;
   
    cout << "Before:";
    OutPut(LL);
   
   
    cout << endl;
    Delete(L, index);
    cout << "After:";
    OutPut(L);
    

    return 0;
}

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int N = 100010;
vector<int>a;
int main()
{
    int n,s;
    cin >> n;
    for (int i = 0; i < 2 * n; i++) {
        
        cin >> s;
        a.push_back(s);
    }
    sort(a.begin(), a.end());
    
    cout << a[(a.size()+1) / 2-1];

    return 0;
}

#include<stdio.h>
int main()
{
    int i,j,n,k,t;
    scanf("%d",&n);
    int a[n];
    for(i = 0; i < n; i++)
    {
        scanf("%d",&a[i]);
    }
    scanf("%d",&k);
    if(k <= a[n-1])
    {
        for(i = 0; i < n; i++)
        {
            if(k <= a[i])
            {
                t = i;
                break;
            }
        }
        for(i = n; i > t; i--)
        {
            a[i] = a[i-1];
        }
        n++;
        a[t] = k;
    }
    else
    {
        a[n] = k;
        n++;
    }
    for(i = 0; i < n; i++)
    {
        printf("%d,",a[i]);
    }
    return 0;
}