CCF-Markdown-201703-3

这道题不存在递归结构

比如区块之间的相互嵌套 还有"[ [] ]" 链接的相互嵌套, 所以直接处理就好了

还可以

 #include <bits/stdc++.h>
 using namespace std;
 string trans (string str) {
     string tmp; int i=;
     while (i<str.size()) {
         bool flag=; string txt,link;
         while (i<str.size()&&str[i]!='[')  tmp+=str[i++];
         if (str[i]=='[') { flag=; i++;}
         if (flag) {
             while (str[i]!=']') txt+=str[i++];
             i+=;
             while (str[i]!=')') link+=str[i++];
             i++;
             tmp+="<a href=\""+link+"\">"+txt+"</a>";
         }
     }
     str=tmp; tmp=""; i=;
     while (i<str.size()) {
         bool flag=; string txt;
         while (i<str.size()&&str[i]!='_') tmp+=str[i++];
         if (str[i]=='_') {flag=; i++;}
         if (flag) {
             while (str[i]!='_') txt+=str[i++];
             i++;
             tmp+="<em>"+txt+"</em>";
         }
     }
     return tmp;
 }
 void trs2(string str) {
     int i=; for (;str[i]==' ';i++);
     cout<<"<li>"<<trans(str.substr(i))<<"</li>\n";
 }
 int main ()
 {
     string str;
     //freopen("test.txt","r",stdin);
     while (getline(cin,str)) {
         if (str[]=='#') {
             int i=,x=;
             for (;str[i]=='#';i++) x++;
             for (;str[i]==' ';i++);
             cout<<"<h"<<x<<">"<<trans(str.substr(i))<<"</h"<<x<<">\n";
         }
         else if (str[]=='*') {
             cout<<"<ul>\n";
             trs2(str);
             while (getline(cin,str)&&str.size()!=)
                 trs2(str);
             cout<<"</ul>\n";
         }
         else if (str.size()!=) {
             cout<<"<p>"<<trans(str);
             while (getline(cin,str)&&str.size()!=)
                 cout<<"\n"<<trans(str);
             cout<<"</p>\n";
         }
     }
     return ;
 }