博客园代码高亮

博客园代码高亮

void searchPath(int *prev,int v, int u)
{
    int que[maxnum];
    int tot = 1;
    que[tot] = u;
    tot++;
    int tmp = prev[u];
    while(tmp != v)
    {
        que[tot] = tmp;
        tot++;
        tmp = prev[tmp];
    }
    que[tot] = v;
    for(int i=tot; i>=1; --i)
        if(i != 1)
            cout << que[i] << " -> ";
        else
            cout << que[i] << endl;
}

---

my first hight light code

some useful website:

博客园资料链接
[highlish.js]https://highlightjs.org/
https://www.sioe.cn/yingyong/yanse-rgb-16/
常用makdowny语法
高级语法/语法大全
Markdown基本语法
颜色选择器

转载于:https://www.cnblogs.com/captain-dl/p/10948181.html