stack栈的模拟
MiniSheep_CS
编程者如上帝,可以创造万物。
展开
-
将中缀表达式转换成后缀表达式
#include#include#include#include#includeusing namespace std;void inToPostfix(){ stack s; char token; cin>>token; while(token != '=') { if(token >= 'a' && token <= '原创 2014-12-18 14:14:41 · 466 阅读 · 0 评论 -
hdu1022 栈的模拟(Train Problem I)
题目的大致意思是原创 2014-10-18 14:03:40 · 488 阅读 · 0 评论 -
POJ3295 Tautology(栈和枚举的应用)
TautologyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10073 Accepted: 3832DescriptionWFF 'N PROOF is a logic game played with dice. Each die has si原创 2015-03-10 17:49:24 · 385 阅读 · 0 评论