![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
栈
NJNUqhx
大一新生,努力学习ing
展开
-
计算相对分子质量
#include<iostream>#include<map>#include<string>#include<stack>using namespace std;map<string,int> elem;int calcul(string& s){ stack<long long> chem; //分别储存括号内数值和括号(用插入0来代替) for(int i=0;i<s.size.原创 2021-04-05 10:25:53 · 748 阅读 · 0 评论 -
2021年1月23日20:17:47 括号匹配(待完善)
/* 2021年1月23日19:53:51 栈应用: 括号匹配 */#include<stdio.h>#include<stdlib.h> struct stack{ char sign; struct stack* next;};void push(stack** head,char c){ stack* p=(stack*)malloc(sizeof(stack)); p->sign=c; p->next=*head; *he.原创 2021-01-23 20:18:44 · 109 阅读 · 0 评论 -
栈(链表实现)
/* create a stack by linllist*/#include<stdio.h>#include<stdlib.h>struct Stack{ int value; struct Stack* next;};typedef struct Stack stack;void menu(void){ printf("menu:\n"); printf("1.initialize\n"); printf("2.p...原创 2021-01-02 12:14:08 · 65 阅读 · 0 评论 -
栈(动态数组实现)
#include<stdio.h>#include<stdlib.h>void menu(void){ printf("menu:\n"); printf("1.initialize\n"); printf("2.push\n"); printf("3.pop\n"); printf("4.isfull\n"); printf("5.isempty\n");}int Choice(void){ int choice=...原创 2021-01-02 11:05:31 · 129 阅读 · 0 评论