C語言實現的單向鍊錶

email:[email protected]

company:

*

modification:

write modifications here.

#ifndef _gm_slink_h

#define _gm_slink_h

#include #ifdef __cplusplus

extern"c"

#endif /**< __cplusplus */

email:[email protected]

company:

*

modification:

write modifications here.

#include "gm_slink.h"

typedef struct link

link_struct;

static link_struct* head = null;

static int count = 0;

static link_struct* createnode(int value)

int gm_slink_get_length()

int gm_slink_add_head( int value )

if (null == head)

else

++count;

return 1;

}int gm_slink_add_tail( int value )

while (null != node->next)

newnode = createnode(value);

if (null == newnode)

node->next = newnode;

++count;

return 1;

}int gm_slink_get_value( int index, int* pvalue)

for (i = 0; i <= index; ++i)

if (null == node)

if (i == index)

node = node->next;

}return 1;

}int gm_slink_remove_head()

node = head;

head = node->next;

free(node);

node = null;

--count;

return 1;

}int gm_slink_remove_tail()

while (null != node->next)

prenode->next = null;

free(node);

node = null;

--count;

return 1;

}int gm_slink_remove( int index )

for (i = 0; i <= index; ++i)

if (null == node)

if (i == index)

else

free(node);

node = null;

--count;

return 1;

}prenode = node;

node = node->next;

}return 1;

}int gm_slink_remove_all()

return 1;

}/* for test

int main()

gm_slink_get_value(5, &i);

gm_slink_remove_head();

gm_slink_remove_tail();

gm_slink_remove_head();

gm_slink_remove_tail();

gm_slink_remove(0);

gm_slink_remove(1);