fix: update

Author: yanglbme

solution/3000-3099/3098.Find the Sum of Subsequence Powers/README.md

@@ -95,7 +95,7 @@ tags:
 
 为了避免重复计算，我们可以使用记忆化搜索的方法，将已经计算过的结果保存起来。
 
-时间复杂度 $O(n^5)$，空间复杂度 $O(n^5)$。其中 $n$ 为数组的长度。
+时间复杂度 $O(n^4 \times k)$，空间复杂度 $O(n^4 \times k)$。其中 $n$ 为数组的长度。
 
 <!-- tabs:start -->
 

solution/3000-3099/3098.Find the Sum of Subsequence Powers/README_EN.md

@@ -93,7 +93,7 @@ The execution process of the function $dfs(i, j, k, mi)$ is as follows:
 
 To avoid repeated calculations, we can use the method of memoization search to save the calculated results.
 
-The time complexity is $O(n^5)$, and the space complexity is $O(n^5)$. Where $n$ is the length of the array.
+The time complexity is $O(n^4 \times k)$, and the space complexity is $O(n^4 \times k)$. Where $n$ is the length of the array.
 
 <!-- tabs:start -->