DS_多链表C++实现

//这是多链表,叫stack是因为写代码的时候脑子有点抽。
//先是定义一个节点类LinkStackNode；
//然后定义一个数组类MultiLinkStack；
//数组的每个节点，相当于链表的头结点；

//另外，代码写的不太严谨，y的值没有去判断是否异常。说白了就是懒。

// MultiLinkStack.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include<iostream>
using namespace std;

template<class T>
class LinkStackNode
{
public:
	T data;
	LinkStackNode<T> *next;
};

template<class T>
class MultiLinkStack
{
public:
	MultiLinkStack(int max0 = 10)
	{
		max = max0 - 1; 
		arr = new LinkStackNode<T>[max0];
		for (int i = 0; i <= max; ++i)
			arr[i].next = NULL;
	}
	~MultiLinkStack(){}
	bool insertN(int x, int y, T data);
	bool deleteN(int x, int y);
	void showN(int x);
private:
	int max;
	LinkStackNode<T> *arr;
};

int main()
{
	MultiLinkStack<char> stack(6);
	stack.insertN(5, 1, 'a');
	stack.insertN(5, 2, 'b');
	stack.showN(5);

	stack.deleteN(5, 2);
	stack.showN(5);

	//stack.insertN(6, 1, 'z');
	system("pause");
    return 0;
}

template<class T>
bool MultiLinkStack<T>::insertN(int x, int y, T data)
{
	if (x > max) { cerr << "excceed x" << endl; return false; }
	LinkStackNode<T> *p = new LinkStackNode<T>;
	p->data = data;
	int j = 1;
	LinkStackNode<T> *before = arr + x;
	while (j < y)//here we don't test the y's legistility
	{
		before = before->next;
		++j;
	}
	p->next = before->next;
	before->next = p;
	return true;
}

template<class T>
bool MultiLinkStack<T>::deleteN(int x, int y)
{
	if (x > max) { cerr << "excceed x" << endl; return false; }
	int j = 1;
	LinkStackNode<T> *before = arr + x, *me;
	while (j < y)
	{
		before = before->next;
		++j;
	}
	me = before->next;
	before->next = me->next;
	delete me;
	return true;
}

template<class T>
void MultiLinkStack<T>::showN(int x)
{
	LinkStackNode<T> *p = arr[x].next;
	int y = 1;
	while (NULL != p)
	{
		cout << "(" << x << "," << y << ") = " << p->data << " ";
		p = p->next;
		++y;
	}
	cout << endl;
}