代码dududu

最新推荐文章于 2024-09-27 17:57:19 发布

aowuwuaowu

最新推荐文章于 2024-09-27 17:57:19 发布

阅读量103

点赞数

文章标签： c++ 算法数据结构

本文链接：https://blog.csdn.net/aowuwuaowu/article/details/128210367

版权

#include<iostream>
using namespace std;
#define OK 1
#define ERROR 0
#define MAXSIZE 100
typedef int datatype;

typedef struct {
    datatype *elem; 
    int length;
} SqList;

int ListInsert_Sq(SqList &L, int i, datatype e) { 
    if ((i < 1) || (i > L.length + 1))
        return ERROR;
    if (L.length == MAXSIZE)
        return ERROR; 
    for (int j = L.length - 1; j >= i - 1; j--)
                  
; 
    
          
; 
    ++L.length;
    return OK;
}

int main() {
    SqList L;
    int i = 0, n,a;
    datatype e;
    L.elem = new datatype[MAXSIZE];
    L.length = 0;
    cin >> n;
    for (i=0;i<n;i++) 
        cin >> L.elem[i];
    L.length = i;
     cin >> a >> e;
    if (ListInsert_Sq(L, a, e))
    {
      for (i = 0; i < L.length; i++)
          if(i==0)
            cout  << L.elem[i];
                  else
                cout  << " " << L.elem[i];                
    }
    else
        cout << "ERROR";
    return 0;
}

#include<iostream>
using namespace std;
#define OK 1
#define ERROR 0
#define MAXSIZE 100
typedef int datatype;

typedef struct {
    datatype *elem; 
    int length;
} SqList;

int ListDelete_Sq(SqList &L, int i) {
    if ((i < 1) || (i > L.length))
        return ERROR; 
    for (int j = i; j <= L.length; j++)
                  
; 
    --L.length; 
    return OK;
}


int main() {
    SqList L;
    int i = 0, n,a;
    datatype e;
    L.elem = new datatype[MAXSIZE];
    L.length = 0;
    cin >> n;
    for (i=0;i<n;i++) 
        cin >> L.elem[i];
    L.length = i;
    cin >> a;
    if (ListDelete_Sq(L, a))
        {
            for (i = 0; i < L.length; i++)
                if(i==0)
                 cout  << L.elem[i];
                else
                 cout  << " " << L.elem[i];                
        }
    else
        cout << "ERROR";

#include<iostream>
using namespace std;
#define MAXSIZE 100
#define ERROR 0
typedef struct { 
    int *elem;
    int length;
} List;

void InitList(List &L) 
{
    L.elem = new int[MAXSIZE];
    L.length = 0;
}

void ListInput(List &L, int n)
{
    int i = 0;
    while (i<n) {
        cin >> L.elem[i];
        i++;
    }
    L.length = i;
}

int ListLength(List L) 
{
    return L.length;
}

void GetElem(List L, int i, int &e)
{
    e = L.elem[i - 1];
}

bool LocateElem(List L, int e) 
{
    int i;
    for (i = 0; i < L.length; i++)
        if (e == L.elem[i])
            return true;
    return false;
}

void ListInsert(List &L, int e) 
{
    L.elem[L.length] = e;
    L.length++;
}

void ListOutput(List L) 
{
    int i;
    for (i = 0; i < L.length; i++)
        cout << L.elem[i] << " ";
    cout << endl;
}

void unionList(List &LA, List LB) 
{
    int LA_len, LB_len, i, e;
    LA_len = ListLength(LA);
    LB_len = ListLength(LB); 
    for (i = 1; i <= LB_len; i++) {
                     ;

        if (       ) 
                     ;

    }
} 

int main() {
    List LA, LB;
    int n, m;
    cin >> n >> m;
    InitList(LA);
    InitList(LB);
    ListInput(LA, n);
    ListInput(LB, m);
    unionList(LA, LB);
    ListOutput(LA);
    return 0;
}