stackli.java

来自「一款五子棋游戏」· Java 代码 · 共 63 行

package five;

class StackLi
{
	int top;
	int back_x,back_y,back_value,back_count;
	mw_Stack[] back = new mw_Stack[300];
	
	StackLi()
	{
		makeEmpty();
		
		for(int g=0;g<300;g++)
		{
			back[g] = new mw_Stack();
			back[g].x = 0;
			back[g].y = 0;
			back[g].value = 0;
			back[g].count = 0;	
		}
	}
	
	public boolean isEmpty()
	{ return top == -1; }
	public boolean isFull()
	{ return top == 299; }
	public void makeEmpty()
	{ top = -1; }
	
	public void push(int x1,int y1,int value1,int count1)
	{	
		back[++top].x = x1;
		back[top].y = y1;
		back[top].value = value1;
		back[top].count = count1;	
	}
	
	public void pop()
	{
			if(top>=0)
			{
			back_x = back[top].x;
			back_y = back[top].y;
			back_value = back[top].value;
			back_count = back[top--].count;
			}		
	}
	class mw_Stack
{
	int x,y;//横竖坐标
	int value;//白或黑(1 or 2)
	int count;//白或黑的第几个Chess
	
	mw_Stack()
	{
		x = 0;
		y = 0;
		value = 0;
		count = 0;	
	}
}		
}