文章目录
机试之数据结构STL详解
vector的常见用法详解:
https://blog.csdn.net/qq_34767784/article/details/103831977
set的常见用法详解:
https://blog.csdn.net/qq_34767784/article/details/103834806
string的常见用法详解:
https://blog.csdn.net/qq_34767784/article/details/103846728
map的常见用法详解:
https://blog.csdn.net/qq_34767784/article/details/103848472
queue的常见用法详解:
https://blog.csdn.net/qq_34767784/article/details/103860948
priority_queue的常见用法详解:
https://blog.csdn.net/qq_34767784/article/details/103865216
stack的常见用法详解:
https://blog.csdn.net/qq_34767784/article/details/103876411
括号匹配
//机试STL之stack——括号匹配
#include <string>
#include <iostream>
#include <algorithm>
#include <stack>
#include <cstdio>
using namespace std;
int main() {
string str;
while(cin>>str){
stack<int> brackets;
string answer(str.size(),' ');//与原字符串等长
for(int i = 0; i < str.size(); ++i){
if(str[i] == '('){
brackets.push(i);
}
else if(str[i] == ')'){
if(!brackets.empty()){
brackets.pop();
}
else{
answer[i] = '?';
}
}
}
while(!brackets.empty()){
answer[brackets.top()] = '$';//左括号失配
brackets.pop();
}
cout<<str<<endl;
cout<<answer<<endl;
}
return 0;
}
表达式求值
相关链接:下面的博客对表达式求值进行了具体详细的讲解
数据结构之栈的应用–中缀表达式转后缀表达式与(简单)表达式的计算
例题:简单计算器
题目描述
题目描述
读入一个只包含 +, -, *, / 的非负整数计算表达式,计算该表达式的值。
输入描述:
测试输入包含若干测试用例,每个测试用例占一行,每行不超过200个字符,整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有0时输入结束,相应的结果不要输出。
输出描述:
对每个测试用例输出1行,即该表达式的值,精确到小数点后2位。
示例1
输入
1 + 2
4 + 2 * 5 - 7 / 11
0
输出
3.00
13.36
//机试STL之stack——表达式求值
#include <string>
#include <iostream>
#include <algorithm>
#include <stack>
#include <cstdio>
using namespace std;
int Priority(char c){//优先级函数
if(c == '#'){
return 0;
}
else if(c == '$'){
return 1;
}
else if(c == '+' || c == '-'){
return 2;
}
else{
return 3;
}
}
double StrToNum(string str, int &index){//字符串转换为数字
double number = 0;
while(isdigit(str[index])){//isdigit()是否是数字0-9
number = number * 10 + str[index] - '0';
index++;
}
return number;
}
double Calculate(double x,double y,char operation){//四则运算
double result = 0;
if(operation == '+'){
result = x + y;
}
else if(operation == '-'){
result = x - y;
}
else if(operation == '*'){
result = x * y;
}
else if(operation == '/'){
result = x / y;
}
return result;
}
int main() {
string str;
while(getline(cin,str)){
if(str == "0"){
break;
}
//声明与初始化
int index = 0;
stack<char> operation;
stack<double> number;
operation.push('#');
str += '$';
while(index < str.size()){
if(str[index] == ' '){//空格
index++;
}
else if(isdigit(str[index])){//数字处理
number.push(StrToNum(str,index));
}
else{//运算符号处理
if( Priority(operation.top()) < Priority(str[index]) ){//当前符号优先级大于符号栈顶符号优先级
operation.push(str[index]);
index++;
}
else{
double y = number.top();
number.pop();
double x = number.top();
number.pop();
number.push( Calculate( x,y,operation.top() ) );
operation.pop();
}
}
}
printf("%.2f\n",number.top());
}
return 0;
}
pair的常见用法详解:
https://blog.csdn.net/qq_34767784/article/details/103877859