show.cpp

数据结构中的双链表问题

#include "show.h"
#include "stdlib.h"
#include "iostream.h"
#include "windows.h"
#include "string.h"
#include "stdio.h"


//	enum TYPE{SH_STATIC=0,SH_UPTODOWN,SH_LEFTTORIGHT,SH_LTORLINE,SH_RAND};
void CShow::SetType(char ** string,int count,TYPE type,int step)
{

	m_nCount=count;
    m_strpString=string;
	m_nStep=step;
	if(type==SH_RAND)
		m_nType=(TYPE)(rand()%5);
	else
		m_nType=type;
}
void CShow::Show()
{
	if(m_strpString)
	{
		switch(m_nType)
        {
        case SH_STATIC:
			Static();
			break;
		case SH_UPTODOWN:
			UpToDown();
			break;
		case SH_LEFTTORIGHT:
			LeftToRight();
			break;
		case SH_LTORLINE :
			LeftToRightLine();
			break;
		case SH_LEFTSHOWLINE:
			LeftShowLine();
			break;
		}
	}
}
void CShow::Static()
{
	for(int i=0;i<m_nCount;i++)
		cout<<m_strpString[i]<<'\n';
	cout<<endl;
}

void CShow::UpToDown()
{
	int j,i;
	for(j=m_nCount;j>=0;j--)
	{
		system("cls");
		for(i=j;i<m_nCount;i++)
		    cout<<m_strpString[i]<<endl;
		Sleep(m_nStep);
	}
	
}

void CShow::LeftToRight()
{
	int j,i,k;
	int stringlen=strlen(m_strpString[0]);
	char *string=new char[stringlen+1];
	for(j=stringlen-2;j>=0;j--,j--)
	{
		
		system("cls");
		for(i=0;i<m_nCount;i++)
		{
			for(k=0;k<stringlen-j;k++)
				string[k]=m_strpString[i][j+k];
            string[k]='\0';
		    cout<<string<<endl;
		}
		Sleep(m_nStep);
	}
}
void CShow::LeftToRightLine()
{
	int j,i,k;
	int stringlen=strlen(m_strpString[0]);
	char *string=new char[stringlen+1];
	for(j=0;j<m_nCount;j++)
	{
		for(i=stringlen-2;i>=0;i--,i--)
		{
			for(k=0;k<stringlen-i;k++)
				string[k]=m_strpString[j][i+k];
            string[k]='\0';
			printf("\r%s",string);
			Sleep(m_nStep);
		}
		cout<<endl;
	}
}

void CShow::LeftShowLine()
{
	int j,i,k;
	int stringlen=strlen(m_strpString[0]);
	char *string=new char[stringlen+1];
	for(j=0;j<m_nCount;j++)
	{
		for(i=0;i<=stringlen;i++,i++)
		{
			for(k=0;k<i;k++)
				string[k]=m_strpString[j][k];
            string[k]='\0';
			printf("\r%s",string);
			Sleep(m_nStep);
		}
		cout<<endl;
	}
}