没什么算法的东西,综合运用STL模板类。
#include <stdio.h>
#include <map>
#include <vector>
#include <set>
#include <string.h>
using namespace std;
typedef char VIRABLE;
typedef int VALUE;
typedef char OPERATION;
map<VIRABLE, VALUE> m;
vector<VIRABLE> vv;
vector<OPERATION> vo;
set<char> s_add, s_sub; //存储最后哦需要自加或自减的字符
char buffer[1000];
char buffer_temp[1000];
void func(int len)
{
int i, j;
m.clear();
vv.clear();
vo.clear();
s_add.clear();
s_sub.clear();
for(i=0; i<len; i++)
{
if(buffer[i]>='a' && buffer[i]<='z')
{
if(i>=2)
{
if(buffer[i-1]=='+' && buffer[i-2]=='+')
{
buffer[i-1] = buffer[i-2] = '?';
m[buffer[i]] = buffer[i]-'a'+1+1;
continue;
}
if(buffer[i-1]=='-' && buffer[i-2]=='-')
{
buffer[i-1] = buffer[i-2] = '?';
m[buffer[i]] = buffer[i]-'a'+1-1;
continue;
}
}
if(i<=len-3)
{
if(buffer[i+1]=='+' && buffer[i+2]=='+')
{
buffer[i+1] = buffer[i+2] = '?';
m[buffer[i]] = buffer[i]-'a'+1;
s_add.insert(buffer[i]);
continue;
}
if(buffer[i+1]=='-' && buffer[i+2]=='-')
{
buffer[i+1] = buffer[i+2] = '?';
m[buffer[i]] = buffer[i]-'a'+1;
s_sub.insert(buffer[i]);
continue;
}
}
m[buffer[i]] = buffer[i]-'a'+1;
}
}
int current_res;
set<char>::iterator it;
map<VIRABLE, VALUE>::iterator it_m;
for(i=0; i<len; i++)
{
if(buffer[i]>='a' && buffer[i]<='z')
{
vv.push_back(buffer[i]);
continue;
}
if(buffer[i]=='+' || buffer[i]=='-')
{
vo.push_back(buffer[i]);
continue;
}
}
current_res = m[vv[0]];
for(i=1, j=0; i<vv.size(); i++,j++)
{
if(vo[j] == '+')
current_res += m[vv[i]];
else
current_res -= m[vv[i]];
}
for(it=s_add.begin(); it!=s_add.end(); it++)
m[*it]++;
for(it=s_sub.begin(); it!=s_sub.end(); it++)
m[*it]--;
printf("Expression: %s\n", buffer_temp);
printf(" value = %d\n", current_res);
for(it_m=m.begin(); it_m!=m.end(); it_m++)
{
printf(" %c = %d\n", it_m->first, it_m->second);
}
}
int main(void)
{
int count, i;
//freopen("input.dat", "r", stdin);
while(gets(buffer_temp))
{
count = 0;
for(i=0; i<strlen(buffer_temp); i++)
{
if(buffer_temp[i] !=' ')
buffer[count++] = buffer_temp[i];
}
buffer[count] = '\0';
func(count);
}
return 0;
}