链表创建及反转

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#define MAXSIZE 128
#define SIZE 10

typedef struct ListNode* List;

struct ListNode{
	int val;
	struct ListNode* next;
};


List CreateList1(List head, int *data, int size) {
	//头插法
	List p;
	int i;
	head->next = NULL;
	
	for(i = 0; i < size; i++){
		p = (List)malloc(sizeof(struct ListNode));
		p->val = data[i];
		p->next = head->next;
		head->next = p;
	}
	
	return head;
} 

List CreateList2(List head, int *data, int size) {
	//尾插法 
	int i;
	List p, q;
	
	p = q = head;
	
	for(i = 0; i < size; i++) {
		p = (List)malloc(sizeof(struct ListNode));
		p->val = data[i];
		q->next = p;
		q = p;
	}
	q->next = NULL;
	
	return head;
}

List ReverseList(List head) {
	List last = NULL, next = NULL, p;
	
	p = head->next;
	
	while(tmp) {
		next = p->next;
		p->next = last;
		last = p;
		p = next;
	}
	head->next = last;
	return head;
}

void PrintList(List head) {
	List t = head->next;
	while(t) {
		printf("%d\t", t->val);
		t = t->next; 
	}
	printf("\n");
}


int main(void)
{
	List list;
	int data[SIZE], i;
	
	for(i = 0; i < SIZE; i++) {
		data[i] = i;
	}
	
	list = (List)malloc(sizeof(struct ListNode));
	list->next = NULL;
	
	list = CreateList2(list, data, SIZE);
	PrintList(list);
	
	printf("list reverse...\n");
	list = ReverseList(list);
	PrintList(list);
	
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值