摘要：#include #include #include typedef struct stack_tag{ int top; int num; int *data;} stack;stack * stack_init(int num){ stack *s = (stack*)m... 阅读全文

摘要：#include #include #include #include void reverse_str(char *pBegin, char *pEnd){ while(pBegin = 0 || j >= 0)); i--, j--, k++){ int a = i >= 0... 阅读全文

摘要：#include #include #include int kmp(const char *str, const char *str_sub){ int sub_len = strlen(str_sub); if(sub_len == 0){ return 0; ... 阅读全文

摘要：根据《算法导论》中介绍的算法实现。 #include #include #include typedef struct priority_queue_tag { int heap_size; int *array;} priority_queue;int parent(int i... 阅读全文