- 栈的组成:一个指针,一个数组
- 逻辑结构:线性
- 物理结构:顺序存储或链式存储
- 特点:操作受限(位置)
- LIFO 后进先出
- 举个栗子:
- 判断回文,利用栈,很方便:
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
char a[124], s[124];
int i, len, mid, next, top;
gets(a);
len = strlen(a);
cout << "len: " << len << endl;
mid = len / 2 - 1;
top = 0;
for(int i = 0; i <= mid; i++) {
s[++top] = a[i];
cout << "s[top]: " << s[top] << endl;
}
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--;
cout << "top: " << top << endl;
}
if(top == 0)
cout << "Yes";
else
cout << "No";
getchar();
getchar();
return 0;
}