diff --git a/articles/search-for-word-ii.md b/articles/search-for-word-ii.md
index 9451914a1..f34cca724 100644
--- a/articles/search-for-word-ii.md
+++ b/articles/search-for-word-ii.md
@@ -341,10 +341,10 @@ class Solution {
### Time & Space Complexity
-- Time complexity: $O(m * n * 4 ^ t + s)$
+- Time complexity: $O(w * m * n * 4 * 3 ^ t - 1)$
- Space complexity: $O(t)$
-> Where $m$ is the number of rows, $n$ is the number of columns, $t$ is the maximum length of any word in the array $words$ and $s$ is the sum of the lengths of all the words.
+> Where $w$ is the number of words, $m$ is the number of rows, $n$ is the number of columns and $t$ is the maximum length of any word in the array $words$.
---
pFad - Phonifier reborn
Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies:
Alternative Proxy
pFad Proxy
pFad v3 Proxy
pFad v4 Proxy