From 4df7229ee4f478226a5f1361b6fed256eac31ca7 Mon Sep 17 00:00:00 2001
From: wonder <hezhaohui0807@163.com>
Date: Sat, 16 May 2026 14:33:21 +0800
Subject: [PATCH] vault backup: 2026-05-16 14:33:21

---
 笔试/微派 Test1/01-LIS返回子序列.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/笔试/微派 Test1/01-LIS返回子序列.md b/笔试/微派 Test1/01-LIS返回子序列.md
index e7c3705..06611e4 100644
--- a/笔试/微派 Test1/01-LIS返回子序列.md	
+++ b/笔试/微派 Test1/01-LIS返回子序列.md	
@@ -48,7 +48,7 @@ create time: 2026-05-16 14:35
 
 转移方程：
 
-\[dp[i] = \max_{j < i, \; nums[j] < nums[i]}(dp[j]) + 1\]
+$$dp[i] = \max \{ dp[j] \} + 1, \quad j < i,\; nums[j] < nums[i]$$
 
 回溯时，从 dp 值最大的位置倒推，找到前驱元素即可恢复完整子序列。