顺序表操作

小飞侠xp

发布于 2021-04-19 16:21:31

4230

发布于 2021-04-19 16:21:31

#include <stdio.h>
#include <stdlib.h>

#define ERROR 0
#define OK 1

typedef struct Vector {
    int size, length;//size 顺序表大小，length现有长度
    int *data;
} Vector;

void init(Vector *vector, int size) {
    vector->size = size;
    vector->length = 0;
    vector->data = (int *)malloc(sizeof(int) * size);
}

int insert(Vector *vector, int loc, int value) {
    if(loc < 0 || loc > vector->length){
        return ERROR;//判断插入位置是否合法
    }
    if(vector->length >= vector->size){
        return ERROR;//判断顺序表的元素是否已经到达上限
    }
    for(int i = vector->length ; i > loc ; i--){
        vector->data[i] = vector->data[i-1];//每次向指定位置loc插入一个元素之前，都要将loc之后的所有元素顺次向后移动，从而给新的元素腾出一个空间。
    }
    vector->data[loc] = value;
    vector->length++;
    return OK;
    
}

void clear(Vector *vector) {
    free(vector->data);
    free(vector);
}

int main() {
    Vector *a = (Vector *)malloc(sizeof(Vector));
    init(a, 100);
    printf("%d\n", insert(a, 1, 0));
    printf("%d\n", insert(a, 0, 1));
    printf("%d\n", insert(a, 2, 1));
    printf("%d\n", insert(a, 1, 2));
    printf("%d\n", insert(a, 0, 3));
    clear(a);
    return 0;
}

增加扩容函数

#include <stdio.h>
#include <stdlib.h>

#define ERROR 0
#define OK 1

typedef struct Vector {
    int size, length;
    int *data;
} Vector;

void init(Vector *vector, int size) {
    vector->size = size;
    vector->length = 0;
    vector->data = (int *)malloc(sizeof(int) * size);
}

// 扩容函数 expand
void expand(Vector *vector){ 
    int *old_data = vector->data;
    vector->size = vector->size * 2; 
    vector->data = (int *)malloc(sizeof(int) * vector->size );
    for(int i = 0 ;i < vector->length ; i++){
        vector->data[i] = old_data[i];
    }
    free(old_data);
}

int insert(Vector *vector, int loc, int value) {
    if (loc < 0 || loc > vector->length) {
        return ERROR;
    }
    if (vector->length >= vector->size) {
       // return ERROR;
        expand(vector);
    }
    for (int i = vector->length; i > loc; --i) {
        vector->data[i] = vector->data[i - 1];
    }
    vector->data[loc] = value;
    vector->length++;
    return OK;
}

void clear(Vector *vector) {
    free(vector->data);
    free(vector);
}

int main() {
    Vector *a = (Vector *)malloc(sizeof(Vector));
    init(a, 100);
    printf("%d\n", insert(a, 1, 0));
    printf("%d\n", insert(a, 0, 1));
    printf("%d\n", insert(a, 2, 1));
    printf("%d\n", insert(a, 1, 2));
    printf("%d\n", insert(a, 0, 3));
    clear(a);
    return 0;
}

增加插入和查找函数

#include <stdio.h>
#include <stdlib.h>

#define ERROR 0
#define OK 1

typedef struct Vector {
    int size, length;
    int *data;
} Vector;

void init(Vector *vector, int size) {
    vector->size = size;
    vector->length = 0;
    vector->data = (int *)malloc(sizeof(int) * size);
}

void expand(Vector *vector) {
    int *old_data = vector->data;
    vector->size = vector->size * 2;
    vector->data = (int *)malloc(sizeof(int) * vector->size);
    for (int i = 0; i < vector->length; ++i) {
        vector->data[i] = old_data[i];
    }
    free(old_data);
}

int insert(Vector *vector, int loc, int value) {
    if (loc < 0 || loc > vector->length) {
        return ERROR;
    }
    if (vector->length >= vector->size) {
        //return ERROR;
        expand(vector);
    }
    for (int i = vector->length; i > loc; --i) {
        vector->data[i] = vector->data[i - 1];
    }
    vector->data[loc] = value;
    vector->length++;
    return OK;
}

int search(Vector *vector, int value) {
    for (int i = 0; i < vector->length; ++i) {
        if (vector->data[i] == value) {
            return i;
        }
    }
    return -1;
}

int delete_node(Vector *vector, int index) {
    //合法性进行判断
    if(index < 0 || index >= vector->length){
        return ERROR;
    }
    for(int i = index + 1; i < vector->length; i++){
        vector->data[i-1] = vector->data[i];
    }
    vector->length--;
    return OK;
}

void clear(Vector *vector) {
    free(vector->data);
    free(vector);
}

int main() {
    Vector *a = (Vector *)malloc(sizeof(Vector));
    init(a, 100);
    printf("%d\n", insert(a, 0, 1));
    printf("%d\n", insert(a, 0, 2));
    printf("%d\n", delete_node(a, 1));
    printf("%d\n", search(a, 0));
    printf("%d\n", search(a, 1));
    clear(a);
    return 0;
}

输入格式第一行输入一个正整数 mm（1 \leq m \leq 1001≤m≤100），代表一共有 mm 个操作。接下来输入 mm 行，每行首先输入一个整数 tt，分别代表以下操作： t = 1，代表插入操作，输入两个整数 a 和 b（1000≤a,b≤100），表示在 a 的位置上擦入元素 b，如果插入成功输出success，否则输出failed。 t=2，代表删除操作，输入一个整数 a（1000≤a≤100），删除位置 a上的元素，如果删除成功输出success，否则输出failed。 t=3，代表查找操作，输入一个整数 a（1000≤a≤100），查找元素值为 a 的元素，如果查找成功输出success，否则输出failed。 t=4，代表遍历操作，输出当前顺序表的所有元素。输出格式对应每个操作，输出结果。对于前三个操作，如果操作成功输出success，否则输出failed；对于第四个操作，从下标为 00 的位置开始输出当前顺序表的所有元素，每两个整数之间一个空格，最后一个整数后面没有空格。

#include <stdio.h>
#include <stdlib.h>

#define ERROR 0
#define OK 1

typedef struct Vector {
    int size, length;
    int *data;
} Vector;

void init(Vector *vector, int size) {
    vector->size = size;
    vector->length = 0;
    vector->data = (int *)malloc(sizeof(int) * vector->size);
}

void expand(Vector *vector) {
    int *old_data = vector->data;
    vector->size = 2 * vector->size;
    vector->data = (int *)malloc(sizeof(int) * vector->size);
    for(int i = 0 ; i < vector->length; i++){
        vector->data[i] = old_data[i];
    }
    free(old_data);

}

int insert(Vector *vector, int loc, int val) {
    //判断插入位置合法性
    if(loc < 0 || loc > vector->length){
        printf("failed\n");
        return ERROR;
    }
    if(vector->length >= vector->size){
        expand(vector);
    }
    for(int i = vector->length; i > loc; --i){
        vector->data[i] = vector->data[i - 1];
    }
    vector->data[loc] = val;
    vector->length++;
    printf("success\n");
    return OK;
}

int search(Vector *vector, int val) {
    for(int i = 0; i < vector->length; i++){
        if(val == vector->data[i]){
            printf("success\n");
            return OK;
        }
    }
    printf("failed\n");
    return -1;

}

int delete_node(Vector *vector, int loc) {
    //判断删除的合法性
    if(loc < 0 || loc > vector->length){
        printf("failed\n");
        return ERROR;
    }
    for(int i = loc + 1; i < vector->length; i++){
        vector->data[i-1] = vector->data[i];
    }
    vector->length --;
    printf("success\n");
    return OK;
}

void print(Vector *vector) {
    for(int i = 0 ;i < vector->length; i++){
        if(i > 0){
            printf(" ");
        }
        printf("%d", vector->data[i]);
    }
    printf("\n");
}

void clear(Vector *vector) {
    free(vector->data);
    free(vector);
}

int main() {
    Vector *a = (Vector *)malloc(sizeof(Vector));
    init(a, 20);
    int m;
    scanf("%d",&m);
    for(int i = 0; i < m; i++){
        int t, loc, val;
        scanf("%d",&t);
        switch(t){
            case 1:
                scanf("%d %d", &loc, &val);
                insert(a, loc, val);
                break;
            case 2:
                scanf("%d", &loc);
                delete_node(a, loc);
                break;
            case 3:
                scanf("%d", &val);
                search(a, val);
                break;
            case 4:
                print(a);
                break;
        }
        
    }

    return 0;
}

本文参与腾讯云自媒体分享计划，分享自作者个人站点/博客。

如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自作者个人站点/博客前往查看

如有侵权，请联系 cloudcommunity@tencent.com 删除。

本文参与腾讯云自媒体分享计划，欢迎热爱写作的你一起参与！

登录后参与评论

0 条评论

热度