Closed YangFong closed 4 weeks ago
Latest commit: |
1a3ff17
|
Status: | ✅ Deploy successful! |
Preview URL: | https://a8cf54bd.doocs-md.pages.dev |
Branch Preview URL: | https://dev-katex.doocs-md.pages.dev |
测试数据:
# 测试
前面一半
$$
\underbrace{| Z - \text{sg}[\tilde{Z}] |2^2}
$$
后面一半
$$
{\mathcal{L}{commit}}
$$
完整
$$
\underbrace{| Z - \text{sg}[\tilde{Z}] |2^2}{\mathcal{L}{commit}}
$$
测试用例:
> 这段代码时间复杂度 $O(n^2)$,空间复杂度 $O(n)$。
$$
\mathcal{L}_{VQ} = \underbrace{\mathcal{L}_{CE}(X, \hat{X})}_{\mathcal{L}_{rec}} + \underbrace{\| \text{sg}[Z] - \tilde{Z} \|_2^2}_{\mathcal{L}_{code}} + \beta \underbrace{\| Z - \text{sg}[\tilde{Z}] \|_2^2}_{\mathcal{L}_{commit}}, \tag{4}
$$
这段代码时间复杂度$O(n^2)$,空间复杂度$O(n)$。
$$
f[i][h]=
\begin{cases}
\max(f[i][h], f[j][h] + 1234343243444554545), & \textit{if } nums[i] = nums[j], \\
\max(f[i][h], f[j][h - 1] + 1), & \textit{if } h > 0.
\end{cases}
$$
🎊 PR Preview has been successfully built and deployed to https://doocs-md-preview-pr-385.surge.sh