typedef struct node
{
	int data;
	struct node* next;
}Node,*LPNode;
LPNode creatnode(int data)
{
	LPNode newnode = (LPNode)malloc(sizeof(Node));
	assert(newnode);
	newnode->data = data;
	newnode->next = NULL;
	return newnode;
}
void insertbytail(LPNode &head,int data)
//這里要么傳引用要么傳二級指針因為這里head賦值并沒有對主函數(shù)里面的head改變
{ 
	if (head == NULL)
	{
		head = creatnode(data);
	}
	else
	{
		LPNode newnode = creatnode(data);
		LPNode pmove = head;
		while (pmove->next!=NULL)
		{
			pmove = pmove->next;
		}
		pmove->next = newnode;
	}
}
void deletetail(LPNode head)
{
	LPNode pronode = head;
	if (head == NULL)
	{
		return;
	}
	LPNode posnode = head->next;
	
	if (pronode->next == NULL)
	{
		cout << pronode->data;
		free(pronode);
		return;
	}
	while (posnode->next!= NULL)
	{
		pronode = posnode;
		posnode = posnode->next;
	}
	cout << posnode->data ;
	free(posnode);
	pronode->next = NULL;
}

創(chuàng)建棧結(jié)構(gòu)

typedef struct stack
{
	int top;//用來判斷是否為空
	LPNode head;
}Stack,*LPStack;
//描述一個棧的最初始的狀態(tài)
LPStack creatstack()
{
	LPStack stack = (LPStack)malloc(sizeof(Stack));
	assert(stack);
	stack->top = 0;
	stack->head = NULL;
	return stack;
}

出棧入棧就是表現(xiàn)為鏈?zhǔn)浇Y(jié)構(gòu)的表尾插入和刪除

void push(LPStack stack,int data)
{
	insertbytail(stack->head, data);
	stack->top++;
}
void pop(LPStack stack)
{
	deletetail(stack->head);
	stack->top--;
}

判斷棧是否為空即判斷 top==0

bool empty(LPStack stack)
{
	return stack->top == 0;
}

代碼實現(xiàn)

int main()
{
	LPNode head = NULL;
	LPStack stack = creatstack();
	int n;
	int num;
	cin >> num;//表示數(shù)
	cin >> n;//表示進(jìn)制
	while (num)
	{
		push(stack,num%n );
		num /= n;
	}
	while (!empty(stack))
	{
		pop(stack);
	}
	
	return 0;
}

以上就是c/c++鏈?zhǔn)蕉褩Ｃ枋鲞M(jìn)制轉(zhuǎn)換問題示例解析的詳細(xì)內(nèi)容，更多關(guān)于c/c++鏈?zhǔn)蕉褩Ｃ枋鲞M(jìn)制轉(zhuǎn)換的資料請關(guān)注腳本之家其它相關(guān)文章！

您可能感興趣的文章: