Skip to content

Commit 2fcfda7

Browse files
committed
feat: add 050
1 parent 4f8f6ba commit 2fcfda7

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

note/050/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ Implement pow(x, n).
77
**Tags:** Math, Binary Search
88

99

10-
## 思路0
10+
## 思路
1111

1212
题意是让你计算`x^n`,如果直接计算肯定会超时,那么我们可以想到可以使用二分法来降低时间复杂度。
1313

0 commit comments

Comments
 (0)