上面的有些算法写得好复杂,写个简单的:
#include
#include
#include
#include
typedef struct node{
char *str; /*拼接后的字符串*/
float value; /*汇率值*/
}node_t;
int main(int argc, char *argv[])
{
/*用户输入的一序列汇率对应关系*/
static char const *buff[] = {"CNY","GBP","0.116",\
"CNY","RUB","8.406",\
"CNY","AUD","0.184",\
"JPY","RUB","0.5072",\
"USD","EUR", "0.9456"};
int npairs = sizeof(buff)/sizeof(buff[0])/3;
node_t * buf = calloc(1,npairs*sizeof(node_t));
if(NULL == buf){
printf("calloc is null !\n");
return(-1);
}
int i = 0;
int j = 0;
int len = 0;
char tmp[16] &