zuoye
来源:互联网 发布:淘宝网狗狗衣服 编辑:程序博客网 时间:2024/04/29 14:14
#include<stdio.h>
#include<string.h>
char str[1000005],ttr[1000005];
int main()
{
int x,len,i,k,flag,ji;
scanf("%d",&x);
getchar();
while(x--)
{ flag=0;
gets(str);
ji=0;
len=strlen(str);
k=-1;
if(len==1)
flag=1;
for(i=0;i<len;i++)
{
if(str[i]=='(')
{ k++;
ttr[k]='(';
}
if(str[i]==')')
{
if(ttr[k]=='(')
{
ji++;k--;
}
}
}
printf("%d\n",ji);
}
return 0;
}
#include<stack>
#include<iostream>
using namespace std;
int main()
{
int n;
double item;
stack<double>numbers;
cout<<"Type in an integer n followed by n decimal number."<<endl
<<"The numbers will be printed in reverse order."<<endl;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>item;
numbers.push(item);
}
cout<<endl<<endl;
while(!numbers.empty())
{
cout<<numbers.top()<<"";
numbers.pop();
}
cout<<endl;
}
#include<stack>
#include<iostream>
using namespace std;
const int maxstack=10;
enum error_code
{
stack();
bool empty();
pop();
top(Stack_entry&item);
push(const Stack_entry&item);
};
class stack
{
public:
stack();
bool empty() const;
error_code pop();
error_code top(Stack_entry&item)const;
error_code push(const Stack_entry&item);
private:
int count;
Stack_entry entry[maxstack];
};
error_code Stack::push(const Stack_entry&item)/*ruzhan*/
{
error_code outcome=success;
if(count>=maxstack)
outcome=overflow;
else
entry[count]=item;
return outcome;
}
error_code Stack::pop()/*chuzhan*/
{
error_code outcome=success;
if(count==0)
outcome=underflow;
else --count;
return outcome;
}
error_code Stack::top(Stack_entry&item)const
{
error_code outcome=success;
if(count==0)
outcome=underflow;
else
item=entry[count-1];
return outcome;
}
bool Stack::empty()const
{
bool outcome=true;
if(count>0)outcome=false;
return outcome;
}
Stack::Stack()
{
count=0;
}
#include<string.h>
char str[1000005],ttr[1000005];
int main()
{
int x,len,i,k,flag,ji;
scanf("%d",&x);
getchar();
while(x--)
{ flag=0;
gets(str);
ji=0;
len=strlen(str);
k=-1;
if(len==1)
flag=1;
for(i=0;i<len;i++)
{
if(str[i]=='(')
{ k++;
ttr[k]='(';
}
if(str[i]==')')
{
if(ttr[k]=='(')
{
ji++;k--;
}
}
}
printf("%d\n",ji);
}
return 0;
}
#include<stack>
#include<iostream>
using namespace std;
int main()
{
int n;
double item;
stack<double>numbers;
cout<<"Type in an integer n followed by n decimal number."<<endl
<<"The numbers will be printed in reverse order."<<endl;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>item;
numbers.push(item);
}
cout<<endl<<endl;
while(!numbers.empty())
{
cout<<numbers.top()<<"";
numbers.pop();
}
cout<<endl;
}
#include<stack>
#include<iostream>
using namespace std;
const int maxstack=10;
enum error_code
{
stack();
bool empty();
pop();
top(Stack_entry&item);
push(const Stack_entry&item);
};
class stack
{
public:
stack();
bool empty() const;
error_code pop();
error_code top(Stack_entry&item)const;
error_code push(const Stack_entry&item);
private:
int count;
Stack_entry entry[maxstack];
};
error_code Stack::push(const Stack_entry&item)/*ruzhan*/
{
error_code outcome=success;
if(count>=maxstack)
outcome=overflow;
else
entry[count]=item;
return outcome;
}
error_code Stack::pop()/*chuzhan*/
{
error_code outcome=success;
if(count==0)
outcome=underflow;
else --count;
return outcome;
}
error_code Stack::top(Stack_entry&item)const
{
error_code outcome=success;
if(count==0)
outcome=underflow;
else
item=entry[count-1];
return outcome;
}
bool Stack::empty()const
{
bool outcome=true;
if(count>0)outcome=false;
return outcome;
}
Stack::Stack()
{
count=0;
}
- zuoye
- zuoye
- ZUOYE
- zuoye
- zuoye
- zuoye
- zuoye
- zuoye
- zuoye
- zuoye
- ZUOYE
- zuoye
- zuoye
- zuoye
- Zuoye
- zuoye
- c++zuoye
- C++ zuoye
- struct nand_ecclayout 之解义 ,eccbytes,eccpos,eccfree
- 全局变量、局部变量、静态全局变量、静态局部变量的区别
- ubuntu下基本网络配置
- leetcode others...
- dup and dup2的剖析
- zuoye
- 浅谈大数据背景下的NUMA架构研究
- 完全卸载Oracle并重装
- Interface Trip Stop - SRS 报错
- javafx之HTTP协议交互
- 成功并不像你想像的那么难
- 深入探究函数返回局部变量
- php多态
- 扫描QR码