数据结构复习-顺序表L中删除重复元素，并使元素相对次序保持不变

// ds1.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
using namespace std;
static int t=1;
class Sqlist
{
public:
	int data[9];
	int len;
protected:
private:
};
void printSQ(Sqlist L)
{
	
	cout<<"time:"<<t++<<":";
	for (int i=0;i<L.len;i++)
	{
		cout<<L.data[i]<<" ";
	}
	cout<<endl;
}
void delSame(Sqlist &L)
{
	printSQ(L);
	int i,j,k;
	if (L.len>0)
	{
		j=0;
		for ( i=1;i<L.len;i++)
		{
			k=0;
			while (k<=j&&L.data[k]!=L.data[i])
			{
				k++;
			}
			if(k==j+1)
			{
				L.data[++j]=L.data[i];
			}
			printSQ(L);
		}
		L.len=j;
	}
}

int main(int argc, char* argv[])
{
	Sqlist L;
	L.data[0]=1;
	L.data[1]=2;
	L.data[2]=3;
	L.data[3]=3;
	L.data[4]=2;
	L.data[5]=1;
	L.data[6]=4;
	L.data[7]=3;
	L.data[8]=5;
	L.len=9;
	delSame(L);

	return 0;

}