① c语言 括号是否匹配。
先按顺序取出所有的括号.然后循环删除_相邻的_差为一或二的_点.最后如果表空则匹配.
单向链表:
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define LEN 80
typedef struct list{
char node;
struct list* next;
}list,*plist;
void iniList(plist);
int isEmpty(plist);
int listAppend(plist,char);
int delBracketsFormList(plist);
int main(int argc,char* argv[]){
char test[LEN];
int i;
list a;
plist p;
p=&a;
iniList(p);
scanf("%80s",test);
for (i=0;i<LEN;i++){
switch(test[i]){
case '[': case']': case'{': case'}': case'(': case')':
listAppend(p,test[i]);
break;
default:continue;
}
}
delBracketsFormList(p);
if (isEmpty(p)){
printf("括号匹配!\n");
}
else
printf("括号不配对!\n");
return 0;
}
void iniList(plist aplist){
aplist->next=NULL;
aplist->node='\0';
}
int isEmpty(plist aplist){
return aplist->next==NULL?1:0;
}
int listAppend(plist aplist,char a){
plist bplist=aplist,anode;
while (bplist->next){
bplist=bplist->next;
}
anode=(plist)malloc(sizeof(list));
if (!anode)exit(-1);
anode->node=a;
anode->next=NULL;
bplist->next=anode;
return 0;
}
int delBracketsFormList(plist aplist){
plist temp;
int has=1;
if (isEmpty(aplist))
return 0;
while(has){
has=0;
temp=aplist;
while (temp->next){
if(temp->next->next){
if((temp->next->next->node - temp->next->node == 1)||(temp->next->next->node - temp->next->node == 2)){
temp->next = temp->next->next->next;
has=1;
}
else
temp = temp->next;
}
else
temp =temp->next;
if(!has)break;
}
}
return 0;
}
② c语言判断一字符串左右括号是否匹配的问题！求助
由于没有分配空间，，，修改如下
#include
#include
#include
//
！！！分配内存头文件
#define
m
20
typedef
char
ElemType;
typedef
struct
{
ElemType
stack[m];
int
top;
}stacknode;
stacknode
*sp;
Init(stacknode
*st)
{
st->top=0;
return
0;
}
void
Push(stacknode
*st,ElemType
x)
{
if(st->top==m)
printf("The
stack
is
overflow!\n");
else
{
st->top=st->top+1;
st->stack[st->top]=x;
}
}
void
Pop(stacknode
*st)
{
st->top=st->top-1;
}
main()
{
char
s[m];
int
i;
printf("Creat
a
stack!\n");
sp
=
(stacknode
*)malloc(sizeof(stacknode));
//
！！！添加的语句
Init(sp);
printf("Input
a
expression:\n");
gets(s);
for(i=0;i
top==0)
printf("左右括号是匹配的！\n");
else
printf("左右括号是不匹配的！\n");
}
③ C语言题，先输入一个整数后接空格代表有几个字符要输入，然后输入字符，判断左/右括号是否配对
d没有初始化 将导致d随机读取内存地址，若是读取的地址是常量地址,一旦修改就会引发segement fault错误
④ C语言 给定的表达式中左右括号数量是否匹配
假定全部都是小括号，int i j
表达式char* ch = "12345((8277)7778"
for(int k =0;k<len;K++)
{
if（ ch[k] = 左括号）i++
if（ ch[k] = 右括号）j++
}
if(i == j) 匹配
否则不匹配
⑤ C语言 判断括号（）是否匹配
#include<iostream>
using namespace std;
#define maxsize 100;
#define T 10;
struct sqstack{
char *base;
char *top;
int stacksize;
};
sqstack inistack(sqstack &s){//初始化栈
s.base=new char[10];
if(!s.base)
cout<<"error";
s.top=s.base;
s.stacksize=maxsize;
return s;
}
sqstack push(sqstack &s,char &e){//进栈
if(s.top-s.base>=s.stacksize){
s.base=new char[10];
if(!s.base)
cout<<"error";
s.top=s.base+s.stacksize;
s.stacksize+=T;
}
*s.top=e;
s.top++;
return s;
}
sqstack pop(sqstack &s, char &e){//出栈
e=*s.top;
-- s.top;
return s;
}
int main(){
char *base,*top;
int total;
cout<<"请输入字符个数:";
cin>>total;
char a[total];
for(int i=0;i<total;i++){
cin>>a[i];
}
sqstack s;
inistack(s);
for (int j=0;j<total;j++){
if(a[j]=='(')
push(s,a[j]);
else if(a[j]==')')
pop(s,a[j]);
}
if(s.base==s.top)
cout<<"true";//匹配完后，如果栈为空，则括号匹配正确
else
cout<<"failed";
system("pause");
return 0;
}