-
Notifications
You must be signed in to change notification settings - Fork 0
/
testcalculator.cpp
91 lines (77 loc) · 1.47 KB
/
testcalculator.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
/*************************************************************************
> File Name: testcalculator.cpp
> Author: lihy
> Mail: lihaiyangcsu@gmail.com
> Created Time: Wed 01 Jul 2015 02:33:01 PM CST
************************************************************************/
#include<stdio.h>
#include<stdlib.h>
#include"definitionstack.h"
const char ADD = '+';
const char MINUS = '-';
const char MULT = '*';
const char DIVI = '/';
const char LP = '(';
const char RP = ')';
int calculator( const char*str, int *res )
{
struct NODE* head = NULL;
while( '\0' != *str )
{
++str;
}
return 0;
}
int symbolmatching( const char* str )
{
struct NODE* stack = NULL;
if( 0 != push( &stack, (int)'#' ) )
return -1;
while( '\0' != *str )
{
char ch = 0;
if( 0 != gettop( &stack, (int*)&ch ) )
return -1;
int flag = 0;
switch( *str )
{
case ')':
if( '(' == ch )
flag = 1;
break;
case '}':
if( '{' == ch )
flag = 1;
break;
case ']':
if( '[' == ch )
flag = 1;
break;
}
if( 1 == flag )
{
if( 0 != pop( &stack, (int*)&ch ) )
return -1;
} else {
if( 0 != push( &stack, (int)*str ) )
return -1;
}
++str;
}
char ch = 0;
if( 0 != gettop( &stack, (int*)&ch ) )
return -1;
if( '#' == ch )
{
if( 0 != pop( &stack, (int*)&ch ) )
return -1;
}
return isempty( &stack );
}
int main()
{
const char* str = "()[]{}";
int ret = symbolmatching( str );
printf( "ret %d \n", ret );
return 0;
}