啊哈算法总结第二章（VSC++编写）

结构体实现队列操作

# include<iostream>
using namespace std;
struct queue
{
	int data[100];
	int head, tail;
};
int main()
{
	struct queue q;
	int i;
	q.head = 1;
	q.tail = 1;
	for (i = 1; i <= 9; i++)
	{
		cin >> q.data[q.tail];
		q.tail++;
	}
	while (q.head < q.tail)
	{
		cout << q.data[q.head];
		q.head++;
		q.data[q.tail] = q.data[q.head];
		q.tail++;
		q.head++;
	}
	system("pause");
	return 0;
}

解密回文—栈

# include<iostream>
#include <string>
#include <cstdio>
using namespace std;
int main()
{
	char a[101],s[101];
	int i,len,mid,next,top;
	cin>>a;
	len= strlen(a);
	mid = len / 2 - 1;
	top = 0;
	for (i = 0; i <= mid; i++)
	{
		s[++top] = a[i];
	}
	if (len % 2 == 0)
	{
		next = mid + 1;
	}
	else {
		next = mid + 2;
	}
	for (i = next; i <= len-1; i++)
	{
		if (a[i] != s[top])
		{
			break;
		}
		top--;
	}
	if (top == 0)
	{
		cout << "Yes";
	}
	else
	{
		cout << "No";
	}
	system("pause");
	return 0;
}