rshchx007的博客

/* find_first_common_node.c * * Copyright (c) 2020 * Author: plant * * This program is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 as published by * the Free Software Foundati

/* is_pop_order.c * * Copyright (c) 2020 * Author: plant * * This program is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 as published by * the Free Software Foundation; either

/* reverse_link_list.c * * Copyright (c) 2020 * Author: plant * * This program is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 as published by * the Free Software Foundation; e

/* queue.c * * Copyright (c) 2020 * Author: plant * * This program is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 as published by * the Free Software Foundation; either versio

/* sq_queue.c * * Copyright (c) 2020 * Author: plant * * This program is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 as published by * the Free Software Foundation; either ver

#include <stdio.h>#define MAX_STACK_SIZE (100)typedef int ELEM_TYPE;typedef struct _sq_stack{ ELEM_TYPE data[MAX_STACK_SIZE]; int top;} sq_stack;void sq_stack_init(sq_stack* stack){ stack->top = -1; return ;}int inline

线性表的顺序存储结构实现#include <stdio.h>#define SQ_LIST_MAX_SIZE (100)typedef int ELEM_TYPE;typedef struct _sq_list{ ELEM_TYPE data[SQ_LIST_MAX_SIZE ]; int len;} sq_list;void clear_sq_list(sq_list list){ list.len = 0;}int sq_list_get_elem(sq_

线性表C语言实现/* The industrial I/O core * * Copyright (c) 2020 Leizhen@xmu.ese * * This program is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 as published by * the Free Software