2024.01.23作业

1.顺序表按元素任意修改

void change_element(sqlist* list, datatype old_element, datatype element)
{
    if (NULL == list || empty(list))
    {
        return;
    }

    for (int i = 0; i < list->length; i++)
    {
        if (old_element == list->data[i])
        {
            list->data[i] = element;
            break;
        }
    }
}

2.顺序表按元素任意删除

void delete_element(sqlist* list, datatype element)
{
    if (NULL == list || empty(list))
    {
        return;
    }

    int index = -1;

    for (int i = 0; i < list->length; i++)
    {
        if (element == list->data[i])
        {
            index = i;
            break;
        }
    }

    if (-1 == index)
    {
        return;
    }

    for (int i = index; i < list->length; i++)
    {
        list->data[i] = list->data[i + 1];
    }
    list->length--;
}

3.顺序表排序

void sort(sqlist* list)
{
    if (NULL == list || empty(list))
    {
        return;
    }

    for (int i = 0; i < list->length - 1; i++)
    {
        for (int j = i; j < list->length; j++)
        {
            if (list->data[i] > list->data[j])
            {
                list->data[i] += list->data[j];
                list->data[j] = list->data[i] - list->data[j];
                list->data[i] -= list->data[j];
            }
        }
    }
}

4.顺序表释放空间

void free_space(sqlist* list)
{
    if (NULL == list)
    {
        return;
    }

    free(list);
    list = NULL;
    puts("free space done");
}

源代码

myfunc.h

#ifndef __MYFUNC_H__
#define __MYFUNC_H__

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

#define MAXSIZE 7

typedef int datatype;
typedef struct SQLIST
{
    datatype data[MAXSIZE];
    int length;
} sqlist;

enum num
{
    FALSE = -1,
    SUCCESS
};

sqlist* create();
int full(sqlist* list);
int empty(sqlist* list);
int insert_rear(datatype element, sqlist* list);
int output(sqlist* list);
int delete_rear(sqlist* list);
void search_index(sqlist* list, int index);
void change_index(sqlist* list, int index, int element);
void insert_element(sqlist* list, int index, int element);
void free_space(sqlist* list);
void delete_element(sqlist* list, datatype element);
void sort(sqlist* list);
void change_element(sqlist* list, datatype old_element, datatype element);

#endif

myfunc.c

#include "myfunc.h"

sqlist* create()
{
    sqlist* list = (sqlist*)malloc(sizeof(sqlist));
    if (NULL == list)
    {
        return NULL;
    }
    memset(list->data, 0, sizeof(list->data));
    list->length = 0;

    return list;
}

int full(sqlist* list)
{
    return list->length == MAXSIZE ? FALSE : SUCCESS;
}

int empty(sqlist* list)
{
    return list->length == 0 ? FALSE : SUCCESS;
}

int insert_rear(datatype element, sqlist* list)
{
    if (NULL == list || full(list))
    {
        return FALSE;
    }

    list->data[list->length++] = element;

    return SUCCESS;
}

int output(sqlist* list)
{
    if (NULL == list || empty(list))
    {
        return FALSE;
    }

    for (int i = 0; i < list->length; i++)
    {
        printf("%-5d", list->data[i]);
    }
    puts("");
    return SUCCESS;
}

int delete_rear(sqlist* list)
{
    if (NULL == list || empty(list))
    {
        return FALSE;
    }
    list->length--;

    return SUCCESS;
}

void search_index(sqlist* list, int index)
{
    if (NULL == list || empty(list) || index < 0 || index >= list->length)
    {
        return;
    }

    printf("list->data[%d] == %d\n", index, list->data[index]);
}

void change_index(sqlist* list, int index, int element)
{
    if (NULL == list || empty(list) || index < 0 || index >= list->length)
    {
        return;
    }

    list->data[index] = element;
}

void insert_element(sqlist* list, int index, int element)
{
    if (NULL == list || empty(list) || index < 0 || index >= list->length)
    {
        return;
    }

    for (int i = list->length - 1; i >= index; i--)
    {
        list->data[i + 1] = list->data[i];
    }
    list->data[index] = element;
    list->length++;
}

void free_space(sqlist* list)
{
    if (NULL == list)
    {
        return;
    }

    free(list);
    list = NULL;
    puts("free space done");
}

void change_element(sqlist* list, datatype old_element, datatype element)
{
    if (NULL == list || empty(list))
    {
        return;
    }

    for (int i = 0; i < list->length; i++)
    {
        if (old_element == list->data[i])
        {
            list->data[i] = element;
            break;
        }
    }
}

void delete_element(sqlist* list, datatype element)
{
    if (NULL == list || empty(list))
    {
        return;
    }

    int index = -1;

    for (int i = 0; i < list->length; i++)
    {
        if (element == list->data[i])
        {
            index = i;
            break;
        }
    }

    if (-1 == index)
    {
        return;
    }

    for (int i = index; i < list->length; i++)
    {
        list->data[i] = list->data[i + 1];
    }
    list->length--;
}

void sort(sqlist* list)
{
    if (NULL == list || empty(list))
    {
        return;
    }

    for (int i = 0; i < list->length - 1; i++)
    {
        for (int j = i; j < list->length; j++)
        {
            if (list->data[i] > list->data[j])
            {
                list->data[i] += list->data[j];
                list->data[j] = list->data[i] - list->data[j];
                list->data[i] -= list->data[j];
            }
        }
    }
}

test.c

#include "myfunc.h"

int main()
{
    sqlist* list = create();

    int n;
    datatype element;

    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &element);
        int flag = insert_rear(element, list);
        if (FALSE == flag)
        {
            puts("list NULL or FULL");
            break;
        }
    }
    output(list);   

    search_index(list, 2);

    puts("将下表3的元素修改为4");
    change_index(list, 2, 4);
    output(list);

    puts("将元素6修改为7");
    change_element(list, 6, 7);
    output(list);

    puts("删除表中元素5");
    delete_element(list, 5);
    output(list);

    puts("排序");
    sort(list);
    output(list);

    return 0;
}

结果

思维导图