Star's Blog

1
Stack CreateStack(int MaxSize) {
2
    Stack st = (Stack)malloc(sizeof(struct SNode));
3
    st->MaxSize = MaxSize;
4
    st->Top = -1;
5
    st->Data = (ElementType *)malloc(sizeof(ElementType) * MaxSize);
6
    return st;
7
}
8

9
void Push(Stack S, ElementType x) {
10
    if (IsFull(S)) {
11
        ElementType *a = S->Data;
12
        S->Data = (ElementType *)malloc(sizeof(ElementType) * S->MaxSize * 2);
13
        for (int i = 0; i < S->MaxSize; ++i) S->Data[i] = a[i];
14
        S->MaxSize *= 2;
15
    }
16
    S->Data[++S->Top] = x;
17
}
18

19
ElementType Pop(Stack S) {
20
    return S->Data[S->Top--];
21
}

1
void AddQ(Queue Q, QueueElementType x) {
2
    PtrToNode t = (PtrToNode)malloc(sizeof(struct Node));
3
    t->Qdata = x;
4
    t->Next = NULL;
5
    if (IsEmpty(Q)) Q->Front = Q->Rear = t;
6
    else Q->Rear->Next = t, Q->Rear = t;
7
}
8

9
QueueElementType DeleteQ(Queue Q) {
10
    PtrToNode t = Q->Front;
11
    QueueElementType res = t->Qdata;
12
    Q->Front = Q->Front->Next;
13
    if (!Q->Front) Q->Rear = NULL;
14
    return t;
15
}

1
#include <string.h>
2
int cmp(char *s, char *t, int l) {
3
    for (int i = 0; i < l; ++i) {
4
        if (s[i] != t[i]) return 0;
5
    }
6
    return 1;
7
}
8

9
void NextValue(char *s, int *ne) {
10
    int n = strlen(s);
11
    ne[0] = -1;
12
    for (int i = 1; i < n; ++i) {
13
        for (int j = i - 1; j >= 0; --j) {
14
            if (cmp(s, s + i - j, j)) {
15
                ne[i] = j;
16
                break;
17
            }
18
        }
19
    }
20
}