线性表之顺序表

里面有个隐患，就是使用了静态数组存放顺序表。实际中，必须用动态数组。 

//
//  main.m
//  SequrenceList顺序表是由静态数组实现的
//
//
#import <Foundation/Foundation.h>

#define LISTSIZE 10
typedef int ElementType;

//用结构体表示一个顺序表
struct SequrenceList {
    ElementType element[LISTSIZE];
    int length;
};

void init(struct SequrenceList *list){
    for (int i = 0; i < LISTSIZE; i++) {
        list->element[i] = 0;
    }
    list->length = 0;
}

bool insert(struct SequrenceList *list, int i, ElementType value){
    //判断是否满表
    if (list->length == LISTSIZE) {
        return false;
    }
    
    //判断插入位置是否正确，[0, lenght]包含的位置均可插入
    if (i < 0 || i > list->length) {
        return false;
    }
    
    //将从插入位置i开始到最后的所有元素，向后移动。
    for (int j = list->length; j > i; j--) {
        list->element[j] = list->element[j - 1];
    }
    
    //为插入位置i的元素赋值
    list->element[i] = value;
    list->length = list->length + 1;
    return true;
}

bool removeElement(struct SequrenceList *list, int i){
    //移除范围[0, length - 1]
    if (i < 0 || i >= list->length) {
        return false;
    }
    
    for (int j = i; j < list->length - 1; j++) {
        list->element[j] = list->element[j + 1];
    }
    
    list->length = list->length - 1;
    return true;
}

bool modify(struct SequrenceList *list, int i, ElementType value){
    //修改范围[0, length - 1]
    if (i < 0 || i >= list->length) {
        return false;
    }
    
    list->element[i] = value;
    return true;
}

int indexByValue(struct SequrenceList *list, ElementType value){
    //查找范围[0, length - 1]
    for (int i = 0; i < list->length; i++) {
        if (list->element[i] == value) {
            return i;
        }
    }
    
    return -1;
}

ElementType* find(struct SequrenceList *list, int i){
    //查找范围[0, length - 1]
    if (i < 0 || i >= list->length) {
        return NULL;
    }
    
    return &list->element[i];
}

int main(int argc, const char * argv[]) {
    
    struct SequrenceList list;
    init(&list);
    
    insert(&list, 0, 100);
    insert(&list, 1, 101);
    insert(&list, 2, 102);
    insert(&list, 3, 103);
    insert(&list, 4, 104);
    insert(&list, 5, 105);
    insert(&list, 3, 1030);
    
    removeElement(&list, 0);
    
    modify(&list, 3, 10300);
    
    printf("%d\r\n", indexByValue(&list, 10300));
    printf("%p\r\n", find(&list, 3));
    
    return 0;
}