혼자공부하기

class Stack
{
private:
	int *stack;
	int top;
	int capacity;
public:
	Stack(int Capacity = 1000);
	int IsEmpty()const;
	int &Top()const;
	void Push(const int &item);
	void Pop();
};
Stack::Stack(int stackCapacity) : capacity(stackCapacity)
{
	stack = new Int[capacity];
	top = -1;
}
int Stack::IsEmpty() const
{
	if (top == -1) return 1;
	else return 0;
}
int & Stack::Top() const
{
	return stack[top];
}
void Stack::Push(const int & item)
{
	stack[++top] = x;
}
void Stack::Pop()
{
	top--;
}

단골문제,, 외우는게 나을듯,,

#include<stdio.h>
int cnt = 1;
void hanoi(int n, int start, int mid, int end)
{
	if (n == 1)
	{
		printf("%d 번: %d에서 %d로감\n",cnt++,start,end );
	} 
	else
	{
		hanoi(n - 1, start, end, mid);
		printf("%d 번: %d에서 %d로감\n", cnt++, start, end);
		hanoi(n - 1, mid, start, end);
	}


}

int main()
{
	int n = 3;
	hanoi(n, 1, 2, 3);


	return 0;
}