feat(post): clarify constant time upper bound

posts/algorithms/leetcode-daily.html

@@ -176,7 +176,7 @@
             2^k-1=x\))). \(x\) and \(n\) have \(lg(x)\) and \(lg(n)\) bits
             respectively, so the solution is \(O(lg(x) + lg(n))\in O(log(xn))\).
             \(1\leq x,n\leq 1e8\), so this runtime is bounded by
-            \(O(log(1e8^2))=O(log(1e16))=O(16)\).
+            \(O(log(1e8^2))=O(log(1e16))=O(16)=O(1)\).
           </p>
         </article>
       </div>