东北大学计算机专业研究生入学考试2006年真题

/*-------------------------------------------------------C语言部分------------------------------------------------------------------*/
/*三.由键盘输入n(n<50)个英文单词，每个单词由空格分隔。试编写一个递归函数，判断这n个单词是否是按字典顺序排列的。*/
#include<stdio.h>
#include<string.h>
#define MAXSIZE 50
int WordSort(char word[][15], int n)
{
	if (n < 0)
		return -1;
	else if (n == 1)
		return 1;
	else 
	{
		if(strcmp(word[n-1], word[n-2])>0 && WordSort(word, n-1))
			return 1;
		else 
			return 0;
	}
}
void main()
{
	char word[MAXSIZE][15];
	int size, i;
	
	printf("输入单词个数,小于50:\n");
	scanf("%d", &size);

	printf("\n输入%d单词,以空格隔开:\n", size);
	for (i = 0; i < size; i++)
		scanf("%s", word[i]);

	switch (WordSort(word, size))
	{
		case -1: 
			printf("\n请输入单词\n");break;
		case 0:
			printf("\n输入的单词不是按字典顺序排序!\n");break;
		case 1:
			printf("\n输入的单词是按字典顺序排序!\n");break;
		default: ;
	}
}

/*四.设有A,B,C三个有序的整数链表（同为递增），试编写程序，删去A链表中那些既在B链表中出现又在C链表中出现的结点。*/
#include <stdio.h>
#include <malloc.h>
typedef struct LNode
{
	int data;
	struct LNode *next;
}LNode;

int CreateLinkList(LNode **head) //创建链表
{
	int iCount, i, iElem;
	LNode *pTemp;
	
	//建立头结点
	*head = (LNode *)malloc(sizeof(LNode));
	(*head)->next = NULL;
	
	printf("\nPlease input the number of elements: ");
	scanf("%d", &iCount);
　　if (!iCount)
		return 0;
		
	for (i = 0; i < iCount; i++)
	{
		printf("No.%d element: ", iCount-i);
		scanf("%d", &iElem);
		pTemp = (LNode *)malloc(sizeof(LNode));
		pTemp->data = iElem;
		pTemp->next = (*head)->next;
		(*head)->next = pTemp;
	}
	return 1;
}

int SortLinkList(LNode *head)  //链表排序
{
	LNode *pFront, *pSearch;
	int iElem;
	if (!head->next)
	{
		printf("Empty!\n");
		return 0;
	}
	pFront = head->next;
	if (pFront->n