#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define Maxsize 10
typedef char elemtype;
struct Node;
typedef struct Node *PtrToNode;
typedef PtrToNode Stack;
typedef struct Node
{
elemtype ch;
Stack next;
}Node;
Stack CreateStack(void)
{
Stack s;
s = (Stack)malloc(sizeof(Node));
if(!s)
printf("Out Of Space\n");
s->next = NULL;
return s;
}
int IsEmpty(Stack s)
{
if(s->next == NULL)
return 0; //0代表栈为空
return 1; //1代表栈非空
}
void Push(Stack s,elemtype x)
{
while(s->next != NULL)
{
s = s->next;
}
//s->ch = x;
Stack tmp;
tmp = (Stack)malloc(sizeof(Node));
if(!tmp)
{
printf("Out of space\n");
exit(1);
}
tmp->ch = x;
s->next = tmp;
tmp->next = NULL;
}
elemtype Top(Stack s)
{
if(!IsEmpty(s))
{
printf("栈以空\n");
return NULL;
}
while(s->next->next != NULL)
{
s = s->next;
}
elemtype x = s->next->ch;
free(s->next);
s->next = NULL;
return x;
}
void MakeEmpty(Stack s)
{
if(!IsEmpty(s))
free(s);
while(s!=NULL)
{
while(!s->next->next == NULL)
{
free(s->next);
s->next = NULL;
}
}
}
int main(void)
{
Stack s;
s = CreateStack();
char a[Maxsize];
while(scanf("%s",a)!=EOF)
{
int len = strlen(a);
for(int i=0;i < len;i ++)
{
if(a[i] == '(' || a[i] == '[' || a[i] == '{')
Push(s,a[i]);
if(a[i] == ')' || a[i] == ']' || a[i] == '}')
{
char ch = Top(s);
if(a[i] == '}'&&ch != '{')
{
printf("No\n");
i = len;
}
if(a[i] == ']'&&ch != '[')
{
printf("No\n");
i = len;
}
if(a[i] == ')'&&ch != '(')
{
printf("No\n");
i = len;
}
}
}
if(!IsEmpty(s))
printf("Yes\n");
else
printf("No\n");
}
return 0;
}相关推荐
实战解析:如何通过LTspice仿真优化MOS管缓启动电路,解决上电冲击电流问题
本文详细解析如何通过LTspice仿真优化MOS管缓启动电路,有效解决上电冲击电流问题。文章从问题根源分析入手,介绍LTspice环境搭建、缓启动电路设计原理、参数优化技巧及实际工程问题排查,帮助工程师掌握MOS管电源开关电路的关键设计方法,提升系统可靠性和性能。
判断表达式的括号是否对称
public class KuoHao {public static void main(String[] args) {System.out.println(isCorrect("a+((d+d)"));System.out.println(isCorrect("a*6-(c+d)"));}public static boolean isCorrect(String reg) {byte[] b...
国科大——形式语言与自动机理论(0812课程)——作业
此次作业题考察,包括但不限于有限自动机、无限自动机、正则文法、正则表达式以及正则语言的性质,题考查下推自动机相关的知识,题考查图灵机相关的知识。此课程建议本科学习过课程的同学选修,成绩占比:考试100%。此课程虽然留有作业,但可做也可不做,且不考勤。
用栈判断是否对称的字符串
先进入字符串括号的前半部分,然后依次弹出前半部分的元素,看与后半部分的元素是否对称,可以用于判断是否是偶数对称回文 class Solution { public boolean isValid(String s) { /*对以一个字符串,采用栈的思想 如果是以(、{、[、开始的,则先存入栈中;在匹配是否有对称的 如果不是这几个字符串,...
智能电网中的智能调度与优化算法研究
本文研究智能电网中的智能调度与优化算法,旨在提高电网运行的效率与可靠性,减少能源浪费和设备故障的风险。在智能电网日益复杂化的背景下,传统的调度方法已难以满足高效、稳定的运行要求,因此亟需借助先进的优化算法对电网进行智能调度。本文第一深入分析智能电网调度中的关键问题与挑战,探讨优化算法在智能电网中的应用现状,并分析常见的优化算法,如遗传算法、粒子群算法和模拟退火算法。随后,本文构建智能电网的调度优化数学模型,并对电网负荷、发电模型及约束条件进行详细建模。在算法部分,本文提出改进的粒子群算法和遗传算法,并结合M
生信入门第七课:使用FastQC软件进行测序原始fastq数据质控
从实验到数据:RNA定量、文库片段长度、fastqc质控和fastp去接头
java验证字符串是否对称
package itHeiMaTestz; /** * 验证字符串是否对称 */ import java.util.Scanner; public class ISEqualStr { public static void main(String[] args) { Scanner scan = new Scanner(System.in); System.ou
PICO+Unity MR空间网格开发实战:从零构建透视交互场景
本文详细介绍了使用PICO 4 Ultra与Unity引擎进行MR空间网格开发的完整实战流程。从环境准备、项目初始化、核心组件配置,到空间网格的生成、可视化与物理交互实现,手把手教你构建一个能识别真实环境并发射虚拟小球的透视交互场景。文章重点解析了PICO SDK中空间网格功能的关键配置与优化技巧,并提供了真机部署与调试的实用指南。
判断对称串(栈应用)
题目描述: 利用顺序栈判断一个字符串是否为对称串。所谓对称串是从左向右读和从右向左读的序列相同。 解题思路: n个元素连续进栈,产生的连续出栈序列和输入序列正好相反,对于字符串str从头到尾将其所有元素连续进栈,如果所有元素连续出栈产生的序列和str从头到尾的字符依次相同,表示str是一个对称串,返回真,否则,表示str不是对称串,返回假。 代码如下: #include<iostr...
【Qt串口调试助手】1.1 - Qt5编写串口调试助手,Qt串口编程
这章来学习串口数据流操作。仿照成品制作一个自己用Qt编写的串口助手。 1. 布局UI界面 创建QWidget工程,布局UI界面:拖入2个 Plain Text Edit,作为串口数据的接收显示和发送框。 拖入几个 Combo Box 、Label 和 Push Button,使用两个Widget进行布局。如下所示。 将接收区的 Plain Text Edit,属性勾选上 readOnly,使其运行时不会被人为的输入操作影响。 加入一些弹簧,使布局美观。(有必要可以加设置不能调整..
R语言绘图中文显示全攻略:从乱码到完美适配
本文详细解析了R语言绘图中的中文显示问题,从乱码根源到完美适配方案。通过showtext、sysfonts和extrafont等工具包的应用,提供跨平台的中文显示解决方案,涵盖ggplot2图表、PDF/PNG输出及Shiny应用等场景,助力用户高效实现R绘图中文完美呈现。
堆栈应用之括弧匹配
#include #include using namespace std; #define STACKSIZE 8 #define SIZEADD 3 typedef char ElemType; typedef struct Stack { ElemType *pBottom; ElemType *pTop; int Stacksize; }Stack; void InitStack(S
YOLO11优化:TGRS2026 CKConv结合C3k2 | 方向特征与跨阶段融合协同,小目标漏检率大幅下降
多尺度适配小目标尺寸变化:在 C3k2 不同阶段配置 CKConv 不同核尺度(浅层小核捕获精细纹理,深层大核聚合上下文),兼顾局部细节与全局感知,提升对舰船、车辆等小尺寸目标及红外热目标的检测鲁棒性。
数据结构-堆栈-括弧匹配检测
问题描述 假设表达式中只允许两种括号:()、{};正确表达顺序为:()或{}或({})或{({}{})}的形势;如{(}或(})或({)}的表达形势均不对。 算法的思想: 出现左括弧则进栈; 出现右括弧则首先检测栈是否为空,若栈空则表示此右括号多余,表达式不匹配; 否则和栈顶数据相比较(栈顶数据即进行比较的前一个数据),若匹配则栈顶出栈; 否则表明表达式不匹配; 结构体: #include<...
LinePhone3.2.7(android端最新版本) sip客户端
SIP客户端For android:LinePhone3.2.7(最新版本),官网地址:http://www.linphone.org/
win10 跳过U8环境检测的IE WebControls.rar
win10 安装u8的时候 提示IE WebControls 不通过,这个工具可以欺骗u8的检查。 跳过U8环境检测的IE WebControls。提示导入失败后,重新检测通过。
堆栈知识
堆栈,常用党,//boolean expressions software bugs,判断括弧合法否 堆栈先入后出,压栈 pop()//出栈 push() //压栈 top()//求顶元素值 if(c=&&sp>1&&st[sp-2]=b&&&sta[sp-1]=u) pop().pop().//是bug就出栈 else push(c)//不是bug就放到栈底
深度学习工具包 DeepLearningToolbox
深度学习工具包Deprecation notice.-----This toolbox is outdated and no longer maintained.There are much better tools available for deep learning than this toolbox, e.g. [Theano](http://deeplearning.net/software/theano/), [torch](http://torch.ch/) or [tensorflow](http://www.tensorflow.org/)I would suggest you use one of the tools mentioned above rather than use this toolbox.Best, Rasmus.DeepLearnToolbox================A Matlab toolbox for Deep Learning.Deep Learning is a new subfield of machine learning that focuses on learning deep hierarchical models of data.It is inspired by the human brain's apparent deep (layered, hierarchical) architecture.A good overview of the theory of Deep Learning theory is[Learning Deep Architectures for AI](http://www.iro.umontreal.ca/~bengioy/papers/ftml_book.pdf)For a more informal introduction, see the following videos by Geoffrey Hinton and Andrew Ng.* [The Next Generation of Neural Networks](http://www.youtube.com/watch?v=AyzOUbkUf3M) (Hinton, 2007)* [Recent Developments in Deep Learning](http://www.youtube.com/watch?v=VdIURAu1-aU) (Hinton, 2010)* [Unsupervised Feature Learning and Deep Learning](http://www.youtube.com/watch?v=ZmNOAtZIgIk) (Ng, 2011)If you use this toolbox in your research please cite [Prediction as a candidate for learning deep hierarchical models of data](http://www2.imm.dtu.dk/pubdb/views/publication_details.php?id=6284)```@MASTERSTHESIS\{IMM2012-06284, author = "R. B. Palm", title = "Prediction as a candidate for learning deep hierarchical models of data", year = "2012",}```Contact: rasmusbergpalm at gmail dot comDirectories included in the toolbox-----------------------------------`NN/` - A library for Feedforward Backpropagation Neural Networks`CNN/` - A library for Convolutional Neural Networks`DBN/` - A library for Deep Belief Networks`SAE/` - A library for Stacked Auto-Encoders`CAE/` - A library for Convolutional Auto-Encoders`util/` - Utility functions used by the libraries`data/` - Data used by the examples`tests/` - unit tests to verify toolbox is workingFor references on each library check REFS.mdSetup-----1. Download.2. addpath(genpath('DeepLearnToolbox'));Example: Deep Belief Network---------------------```matlabfunction test_example_DBNload mnist_uint8;train_x = double(train_x) / 255;test_x = double(test_x) / 255;train_y = double(train_y);test_y = double(test_y);%% ex1 train a 100 hidden unit RBM and visualize its weightsrand('state',0)dbn.sizes = [100];opts.numepochs = 1;opts.batchsize = 100;opts.momentum = 0;opts.alpha = 1;dbn = dbnsetup(dbn, train_x, opts);dbn = dbntrain(dbn, train_x, opts);figure; visualize(dbn.rbm{1}.W'); % Visualize the RBM weights%% ex2 train a 100-100 hidden unit DBN and use its weights to initialize a NNrand('state',0)%train dbndbn.sizes = [100 100];opts.numepochs = 1;opts.batchsize = 100;opts.momentum = 0;opts.alpha = 1;dbn = dbnsetup(dbn, train_x, opts);dbn = dbntrain(dbn, train_x, opts);%unfold dbn to nnnn = dbnunfoldtonn(dbn, 10);nn.activation_function = 'sigm';%train nnopts.numepochs = 1;opts.batchsize = 100;nn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.10, 'Too big error');```Example: Stacked Auto-Encoders---------------------```matlabfunction test_example_SAEload mnist_uint8;train_x = double(train_x)/255;test_x = double(test_x)/255;train_y = double(train_y);test_y = double(test_y);%% ex1 train a 100 hidden unit SDAE and use it to initialize a FFNN% Setup and train a stacked denoising autoencoder (SDAE)rand('state',0)sae = saesetup([784 100]);sae.ae{1}.activation_function = 'sigm';sae.ae{1}.learningRate = 1;sae.ae{1}.inputZeroMaskedFraction = 0.5;opts.numepochs = 1;opts.batchsize = 100;sae = saetrain(sae, train_x, opts);visualize(sae.ae{1}.W{1}(:,2:end)')% Use the SDAE to initialize a FFNNnn = nnsetup([784 100 10]);nn.activation_function = 'sigm';nn.learningRate = 1;nn.W{1} = sae.ae{1}.W{1};% Train the FFNNopts.numepochs = 1;opts.batchsize = 100;nn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.16, 'Too big error');```Example: Convolutional Neural Nets---------------------```matlabfunction test_example_CNNload mnist_uint8;train_x = double(reshape(train_x',28,28,60000))/255;test_x = double(reshape(test_x',28,28,10000))/255;train_y = double(train_y');test_y = double(test_y');%% ex1 Train a 6c-2s-12c-2s Convolutional neural network %will run 1 epoch in about 200 second and get around 11% error. %With 100 epochs you'll get around 1.2% errorrand('state',0)cnn.layers = { struct('type', 'i') %input layer struct('type', 'c', 'outputmaps', 6, 'kernelsize', 5) %convolution layer struct('type', 's', 'scale', 2) %sub sampling layer struct('type', 'c', 'outputmaps', 12, 'kernelsize', 5) %convolution layer struct('type', 's', 'scale', 2) %subsampling layer};cnn = cnnsetup(cnn, train_x, train_y);opts.alpha = 1;opts.batchsize = 50;opts.numepochs = 1;cnn = cnntrain(cnn, train_x, train_y, opts);[er, bad] = cnntest(cnn, test_x, test_y);%plot mean squared errorfigure; plot(cnn.rL);assert(er<0.12, 'Too big error');```Example: Neural Networks---------------------```matlabfunction test_example_NNload mnist_uint8;train_x = double(train_x) / 255;test_x = double(test_x) / 255;train_y = double(train_y);test_y = double(test_y);% normalize[train_x, mu, sigma] = zscore(train_x);test_x = normalize(test_x, mu, sigma);%% ex1 vanilla neural netrand('state',0)nn = nnsetup([784 100 10]);opts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samples[nn, L] = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.08, 'Too big error');%% ex2 neural net with L2 weight decayrand('state',0)nn = nnsetup([784 100 10]);nn.weightPenaltyL2 = 1e-4; % L2 weight decayopts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex3 neural net with dropoutrand('state',0)nn = nnsetup([784 100 10]);nn.dropoutFraction = 0.5; % Dropout fraction opts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex4 neural net with sigmoid activation functionrand('state',0)nn = nnsetup([784 100 10]);nn.activation_function = 'sigm'; % Sigmoid activation functionnn.learningRate = 1; % Sigm require a lower learning rateopts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex5 plotting functionalityrand('state',0)nn = nnsetup([784 20 10]);opts.numepochs = 5; % Number of full sweeps through datann.output = 'softmax'; % use softmax outputopts.batchsize = 1000; % Take a mean gradient step over this many samplesopts.plot = 1; % enable plottingnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex6 neural net with sigmoid activation and plotting of validation and training error% split training data into training and validation datavx = train_x(1:10000,:);tx = train_x(10001:end,:);vy = train_y(1:10000,:);ty = train_y(10001:end,:);rand('state',0)nn = nnsetup([784 20 10]); nn.output = 'softmax'; % use softmax outputopts.numepochs = 5; % Number of full sweeps through dataopts.batchsize = 1000; % Take a mean gradient step over this many samplesopts.plot = 1; % enable plottingnn = nntrain(nn, tx, ty, opts, vx, vy); % nntrain takes validation set as last two arguments (optionally)[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');```[](https://bitdeli.com/free "Bitdeli Badge")
数据结构和算法之堆栈应用:使用堆栈检查括号是否平衡
数据结构和算法之堆栈应用:使用堆栈检查括号是否平衡 下面展示为栈 Stack。 // 栈的定义: 先进后出 class Stack { // 构造函数 dddd constructor(){ this.arr = []; } push(element){ // 入栈 this.arr.push(element); } pop() { // 出栈 return this.arr.pop(); } }
数据结构(三)栈结构模拟编译器判断括号是否匹配
栈结构模拟编译器判断括号是否匹配
堆栈简单分析
函数体内局部变量: 在函数内有较多局部变量时,就需要注意是否超过我们配置的堆栈大小。 函数参数: 传递指针只占4字节,如果传递的是结构体,就会占用结构大小空间。 提示:在函数嵌套,递归时,系统仍会占用栈空间。 4拓展:MDK中RAM占用大小分析 经常在线调试的人,可能会分析一些底层的内容。这里结合MDK-ARM来分析一下RAM占用大小的问题。 在MDK编译之后,会有一段RAM大小信息: 这个大小为0x668,在进行在调试时,会出现: 这个MSP就是主堆栈指针,一般我
(Java)leetcode-20 Valid Parentheses
题目 【括弧匹配】 Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same t...
【栈】1354:括弧匹配检验
【题目描述】 假设表达式中允许包含两种括号:圆括号和方括号,其嵌套的顺序随意,如([ ]())或[([ ][ ])]等为正确的匹配,[( ])或([ ]( )或 ( ( ) ) )均为错误的匹配。现在的问题是,要求检验一个给定表达式中的括弧是否正确匹配?输入一个只包含圆括号和方括号的字符串,判断字符串中的括号是否匹配,匹配就输出 “OK” ,不匹配就输出“Wrong”。输入一个字符串:[([][...
堆栈中的ss,bp,sp
各个寄存器的作用:http://zhidao.baidu.com/question/160825596.html?push=ql http://www.cnblogs.com/awpatp/archive/2010/07/07/1772725.html 已知(SS)=2000
数据段、代码段、堆栈段、BSS段的区别
本文结合实际的例子讲述一下数据段、代码段、堆栈段以及BSS段。more。
常考编程题之栈和队列
两个队列实现栈; 两个栈实现队列; 有效括弧序列:判断一个字符串是否为有效括弧 求最小k个数; 数据流求中位数; 表达式求值
问题 D: DS堆栈--括号匹配
#include<iostream> #include<stack> #include<map> #include<cmath> #include<string.h> #include<algorithm> using namespace std; stack<char> p; int main() { int t; cin >> t; while (t--) { string str; ci
用栈实现括弧匹配
#include #include using namespace std; void Bracket(char *a,int len) { stack temp; for(int i=0;i
程序存储空间(代码段、数据段、堆栈段)
目录 一、各个段的数据类型 二、代码示例 C语言代码 非重定位反汇编 重定位反汇编 三、总结 一、各个段的数据类型 .text: 代码段 .data: 已初始化的全局变量,已初始化的静态变量。数组、结构体也是(它们也属于变量)。 .rodata: const变量;字符串 .bss: 未初始化或初始化为0的全局变量; 未初始化或初始化...
堆栈应用括号匹配实验
堆栈括号匹配
516



被折叠的 条评论
为什么被折叠?



