数据结构之顺序表

逃离我推掉我的手 2022-05-27 06:57 177阅读 0赞

List.h头文件：

#pragma once
    
    class List {
    
    public:
    
        List(int size);
        ~List();
        bool insert(int *ele, int locate = -1);
        bool del(int locate, int *e);       
        bool isEmpty();
        int  length();
        void clear();
        bool preElem(int *current, int *preElem);
        bool nextElem(int *current, int *nextElem);
        bool get(int locate, int *e);
        int  locate(int *e);
        void printAll();
    
    private:
        int m_iSize;    
        int m_iLength;
        int *m_pList;
    
    };

List.cpp：

#include "List.h"
    #include <iostream>
    #include <stdlib.h>
    
    using namespace std;
    
    List::List(int size) {
        m_iSize = size; 
        m_pList = new int[size];
    };
    List::~List() {
        delete m_pList;
    };
    bool List::insert(int *ele, int locate) {
    
        if (m_iLength >= m_iSize) {
            return false;
        }
        if (locate < -1 || locate > m_iLength) {
            return false;
        }
        if (locate == -1) { //表示直接追加在后面
            m_pList[m_iLength] = *ele;
        }
        else {
            //如果不是插入在最后的位置，那么后面的元素要后移
            for (int i = m_iLength; i > locate; i--)
            {
                m_pList[i] = m_pList[i - 1];
            }
            m_pList[locate] = *ele;
        }
        m_iLength++;
    };
    
    bool List::del(int locate, int *e) {
        if (isEmpty()) {
            return false;
        }
        if (locate < 0 || locate >= m_iLength) {
            return false;
        }
        *e = m_pList[locate];
        //后面元素前移
        for (int i = locate; i < m_iLength-1; i++)
        {
            m_pList[i] = m_pList[i + 1];
        }
    
        m_iLength--;
    };
    
    bool List::isEmpty() {
        return m_iLength == 0;
    };
    
    int  List::length() {
        return m_iLength;
    };
    
    void List::clear() {
        m_iLength = 0;
    };
    
    bool List::preElem(int *current, int *preElem) {
    
        int index = locate(current);
        if (index <= 0) {
            return false;
        }
    
        *preElem = m_pList[index - 1];
        return true;
    };
    
    bool List::nextElem(int *current, int *nextElem) {
    
        int index = locate(current);
        if (index >= m_iLength - 1) {
            return false;
        }
    
        *nextElem = m_pList[index + 1];
        return true;
    };
    
    bool List::get(int locate, int *e) {
    
        if (locate < 0 || locate >= m_iLength) {
            return false;
        }
    
        *e = m_pList[locate];
        return true;
    };
    
    int List::locate(int *e) {
        for (int i = 0; i < m_iLength; i++)
        {
            if (m_pList[i] == *e) {
                return i;
            }
        }
        return -1;
    };
    
    void List::printAll() {
        for (int i = 0; i < m_iLength; i++)
        {
            cout << m_pList[i] << endl;
        }
    };

测试：

#include <iostream>
    #include <stdlib.h>
    #include "List.h"
    
    using namespace std;
    
    
    int main(void) {
        int e1 = 1;
        int e2 = 2;
        int e3 = 3;
        int e4 = 4;
        int e5 = 5;
    
        List *pList = new List(10);
        pList->insert(&e1);
        pList->insert(&e2);
        pList->insert(&e3);
        pList->insert(&e4);
    
        pList->printAll();
        cout << "当前表长度：" << pList->length() << endl;
    
        pList->insert(&e5,2);
        pList->printAll();
        cout << "当前表长度：" << pList->length() << endl;
    
        int ele;
        if (pList->preElem(&e2, &ele)) {
            cout << "找到前一个元素：" << ele << endl;
        }
    
        if (pList->nextElem(&e2, &ele)) {
            cout << "找到后一个元素：" << ele << endl;
        }
        if (pList->get(2,&ele)) {
    
        }
        cout << "找到下标为2的元素为：" << ele << endl;
    
        delete pList;
        pList = NULL;
        system("pause");
        return 0;
    
    }