/*****************************************************
copyright (C), Nanjing University of ZiJin
File name:linkedlist.c
Author: CaoMengDe Version:0.1 Date: 2016-12-12 11:11
Description:
Funcion List:
*****************************************************/
#include <stdio.h>
#include <stdlib.h>
#define OK 1
#define ERROR 0
typedef int Status;
typedef int ElementType;
typedef struct node
{
ElementType value;
struct node *next;
}Node;
Status init(Node** head);
Status inserthead(Node* head, ElementType x);
Status inserttail(Node* head, ElementType x);
Status insertmid(Node* head, int index, ElementType x);
Status update(Node* head, int index, ElementType x);
void query(Node* head, ElementType x);
Status delete(Node* head, int index);
Status deletemore(Node* head, ElementType x);
void sort(Node* head);
int length(Node* head);
void print(Node* head);
int main(int argc, char **argv)
{
int ret;
Node* head;
ret = init(&head);
if(ERROR == ret)
{
return -1;
}
ret = inserthead(head, 4);
ret = inserthead(head, 2);
ret = inserttail(head, 3);
ret = insertmid(head, 2, 100);
ret = update(head, 1, 66);
ret = length(head);
// ret = delete(head, 2);
ret = deletemore(head, 2);
//query(head, 3);
sort(head);
print(head);
return 0;
}
Status init(Node** head)
{
Node* new = (Node*)malloc(sizeof(Node));
if(new == NULL)
{
return ERROR;
}
*head = new;
(*head)->next = NULL;
}
Status inserthead(Node* head, ElementType x)
{
Node* new = (Node*)malloc(sizeof(Node));
if(NULL == new)
{
return ERROR;
}
if(head->next == NULL)
{
new->value = x;
head->next = new;
new->next = NULL;
}
else
{
new->next = head->next;
head->next = new;
new->value = x;
}
return OK;
}
Status inserttail(Node* head, ElementType x)
{
while(head->next != NULL)
{
head = head->next;
}
Node* new = (Node*)malloc(sizeof(Node));
if(new == NULL)
{
return ERROR;
}
head->next = new;
new->value = x;
new->next = NULL;
return OK;
}
Status insertmid(Node* head, int index, ElementType x)
{
int i;
if(index < 0||index > length(head))
{
printf("out of length!");
}
for(i = 0; i < index; i++)
{
head = head->next;
}
Node* new = (Node*)malloc(sizeof(Node));
if(NULL == new)
{
return ERROR;
}
new->next = head->next;
head->next = new;
new->value = x;
return OK;
}
Status update(Node* head, int index, ElementType x)
{
int i;
if(index < 1||index > length(head))
{
printf("out of length!");
}
for(i = 0; i < index; i++)
{
head = head->next;
}
head->value = x;
return OK;
}
void query(Node* head, ElementType x)
{
int index = 1;
int count = 0;
while(head->next != NULL)
{
if(head->next->value == x)
{
printf("index = %d value = %d\n", index, x);
count++;
}
index++;
head = head->next;
}
if(count == 0)
{
printf("There is no %d\n", x);
}
}
Status delete(Node* head, int index)
{
int i;
if(index < 1||index > length(head))
{
return ERROR;
}
for(i = 0; i < index - 1; i++)
{
head = head->next;
}
Node* temp = head->next;
head->next = head->next->next;
free(temp);
temp = NULL;
return OK;
}
Status deletemore(Node* head, ElementType x)
{
while(head->next != NULL)
{
if(head->next->value == x)
{
Node* temp = head->next;
head->next = head->next->next;
free(temp);
temp = NULL;
}
else
{
head = head->next;
}
}
}
//排序 从小到大
void sort(Node* head)
{
int i,j;
for( i = 0; i < length(head) - 1; i++)
{
Node* temp = head;
for(j = 0; j < length(head) - 1 - i;j++)
{
if(temp->next->value > temp->next->next->value)
{
int t = temp->next->value;
temp->next->value = temp->next->next->value;
temp->next->next->value = t;
}
temp = temp->next;
}
}
}
void print(Node* head)
{
while(head->next!= NULL)
{
printf("%d\t", head->next->value);
head = head->next;
}
}
int length(Node* head)
{
int count = 0;
while(head->next != NULL)
{
head = head->next;
count++;
}
return count;
}
copyright (C), Nanjing University of ZiJin
File name:linkedlist.c
Author: CaoMengDe Version:0.1 Date: 2016-12-12 11:11
Description:
Funcion List:
*****************************************************/
#include <stdio.h>
#include <stdlib.h>
#define OK 1
#define ERROR 0
typedef int Status;
typedef int ElementType;
typedef struct node
{
ElementType value;
struct node *next;
}Node;
Status init(Node** head);
Status inserthead(Node* head, ElementType x);
Status inserttail(Node* head, ElementType x);
Status insertmid(Node* head, int index, ElementType x);
Status update(Node* head, int index, ElementType x);
void query(Node* head, ElementType x);
Status delete(Node* head, int index);
Status deletemore(Node* head, ElementType x);
void sort(Node* head);
int length(Node* head);
void print(Node* head);
int main(int argc, char **argv)
{
int ret;
Node* head;
ret = init(&head);
if(ERROR == ret)
{
return -1;
}
ret = inserthead(head, 4);
ret = inserthead(head, 2);
ret = inserttail(head, 3);
ret = insertmid(head, 2, 100);
ret = update(head, 1, 66);
ret = length(head);
// ret = delete(head, 2);
ret = deletemore(head, 2);
//query(head, 3);
sort(head);
print(head);
return 0;
}
Status init(Node** head)
{
Node* new = (Node*)malloc(sizeof(Node));
if(new == NULL)
{
return ERROR;
}
*head = new;
(*head)->next = NULL;
}
Status inserthead(Node* head, ElementType x)
{
Node* new = (Node*)malloc(sizeof(Node));
if(NULL == new)
{
return ERROR;
}
if(head->next == NULL)
{
new->value = x;
head->next = new;
new->next = NULL;
}
else
{
new->next = head->next;
head->next = new;
new->value = x;
}
return OK;
}
Status inserttail(Node* head, ElementType x)
{
while(head->next != NULL)
{
head = head->next;
}
Node* new = (Node*)malloc(sizeof(Node));
if(new == NULL)
{
return ERROR;
}
head->next = new;
new->value = x;
new->next = NULL;
return OK;
}
Status insertmid(Node* head, int index, ElementType x)
{
int i;
if(index < 0||index > length(head))
{
printf("out of length!");
}
for(i = 0; i < index; i++)
{
head = head->next;
}
Node* new = (Node*)malloc(sizeof(Node));
if(NULL == new)
{
return ERROR;
}
new->next = head->next;
head->next = new;
new->value = x;
return OK;
}
Status update(Node* head, int index, ElementType x)
{
int i;
if(index < 1||index > length(head))
{
printf("out of length!");
}
for(i = 0; i < index; i++)
{
head = head->next;
}
head->value = x;
return OK;
}
void query(Node* head, ElementType x)
{
int index = 1;
int count = 0;
while(head->next != NULL)
{
if(head->next->value == x)
{
printf("index = %d value = %d\n", index, x);
count++;
}
index++;
head = head->next;
}
if(count == 0)
{
printf("There is no %d\n", x);
}
}
Status delete(Node* head, int index)
{
int i;
if(index < 1||index > length(head))
{
return ERROR;
}
for(i = 0; i < index - 1; i++)
{
head = head->next;
}
Node* temp = head->next;
head->next = head->next->next;
free(temp);
temp = NULL;
return OK;
}
Status deletemore(Node* head, ElementType x)
{
while(head->next != NULL)
{
if(head->next->value == x)
{
Node* temp = head->next;
head->next = head->next->next;
free(temp);
temp = NULL;
}
else
{
head = head->next;
}
}
}
//排序 从小到大
void sort(Node* head)
{
int i,j;
for( i = 0; i < length(head) - 1; i++)
{
Node* temp = head;
for(j = 0; j < length(head) - 1 - i;j++)
{
if(temp->next->value > temp->next->next->value)
{
int t = temp->next->value;
temp->next->value = temp->next->next->value;
temp->next->next->value = t;
}
temp = temp->next;
}
}
}
void print(Node* head)
{
while(head->next!= NULL)
{
printf("%d\t", head->next->value);
head = head->next;
}
}
int length(Node* head)
{
int count = 0;
while(head->next != NULL)
{
head = head->next;
count++;
}
return count;
}