【数据结构】NOJ001 顺序表的插入运算

1. 题目

示例输入
7
2 3 4 5 6 7 8
1
示例输出
1 2 3 4 5 6 7 8

2. 代码

//7
//2 3 4 5 6 7 8
//1

#include <iostream>
#include <malloc.h>

using namespace std; 

typedef struct node{
	int data;
	struct node *next;
}Node;

void createList(Node *head, int n);
void insertList(Node *head, int x);
void outputList(Node *head);

int main(int argc, char** argv) {
	int elenum, x;
	cin >> elenum;
	Node *head;
	head = (Node*) malloc(sizeof(Node));
	createList(head, elenum);
	cin >> x;
	insertList(head, x);
	outputList(head);
	return 0;
}

void createList(Node *head, int n){
	Node *p;
	p = (Node*) malloc(sizeof(Node));
	p = head;
	for(int i=0; i<n; i++){
		p->next = (Node*) malloc(sizeof(Node));
		cin >> p->next->data;
		p = p->next;
	}
	p->next = NULL;
}

void insertList(Node *head, int x){
	Node *p, *px;
	p = head;
	px = (Node*) malloc(sizeof(Node));
	px->data = x;
	while(p->next){
		if(p->data >= x){
			px->next = p->next;
			p->next = px;
			return;
		}
		else{
			p = p->next;
		}
	}
	p->next = px;
	px->next = NULL;
}

void outputList(Node *head){
	Node *p;
	p = head->next;
	while(p){
		cout << p->data << " "; 
		p = p->next;
	}
}