fileread.cpp

数据结构课程设计,表达式,用C语言实现,难度系数较高

#include <stdio.h>
#include <stdlib.h>
#include "../header/bitree.h"
#include "../header/queue.h"
#include "../header/stack.h"
#include "../header/expr.h"
#include "../header/FileRead.h"
/*
void FileRead( void)//int *num, char **ch1, char **ch3, char **ch6, char **ch7, char **ch8	)
{
	FILE *fp;
	//char ch;
	if((fp=fopen("pt.txt","rb"))==NULL)//read
	{
		printf("Cannot open file strike any key exit!");
		exit(0);
	}*/
	/*int num[9]; 

	char ch1[30][20];
	char ch3[10][20];
	char ch6[10][20];
	char ch7[15][20];
	char ch8[10][20];*/

/*
	int i = -1, j;
	fscanf( fp, "%d \n", &num[++i] );	//ch1
	for( j = 0; j < num[i]; ++j )		
		fscanf( fp, "%s \n",ch1[j]);

	fscanf( fp, "%d \n", &num[++i] );	//ch3
	for( j = 0; j < num[i]; ++j )		
		fscanf( fp, "%s \n", ch3[j] );

	fscanf( fp, "%d \n", &num[++i] );	//ch6
	for( j = 0; j < num[i]; ++j )		
		fscanf( fp, "%s \n", ch6[j] );

	fscanf( fp, "%d \n", &num[++i] );	//ch7
	for( j = 0; j < num[i]; ++j )		
		fscanf( fp, "%s \n", ch7[j] );

	fscanf( fp, "%d \n", &num[++i] );	//ch8
	for( j = 0; j < num[i]; ++j )		
		fscanf( fp, "%s \n", ch8[j] );

	
//ch1
	i = -1;
	printf("%d \n", num[++i] );
	for( j = 0; j < num[i]; ++j )		
		printf( "%s \n",ch1[j]);

//ch3	
	printf("\n%d \n", num[++i] );
	for( j = 0; j < num[i]; ++j )		
		printf( "%s \n", ch3[j] );

//ch6
	printf("\n%d \n", num[++i] );
	for( j = 0; j < num[i]; ++j )		
		printf( "%s \n", ch6[j] );

//ch7
	printf("\n%d \n", num[++i] );
	for( j = 0; j < num[i]; ++j )		
		printf( "%s \n", ch7[j] );

//ch8
	printf("\n%d \n", num[++i] );
	for( j = 0; j < num[i]; ++j )		
		printf( "%s \n", ch8[j] );

	fclose(fp);
}
*/