150強訪談簡單

战俘(x,n)

“Pow(x, n)”问题的详细指南和 Python 实现。

問題陳述

簡單

實作 pow(x, n),它計算 x 的 n 次方(即 x^n)。

實作函數 myPow(x: float, n: int) -> float

約束條件
  • -100.0 < x < 100.0
  • -2^31 <= n <= 2^31 - 1
  • n is an integer
  • Either x is not zero or n > 0
  • -10^4 <= x^n <= 10^4

範例

Example 1
Input
2.00000, 10
Output
1024.00000
Explanation

2^10 = 1024.

Example 2
Input
2.10000, 3
Output
9.26100
Explanation

2.1^3 = 9.261.

Example 3
Input
2.00000, -2
Output
0.25000
Explanation

2^(-2) = 1/(2^2) = 1/4 = 0.25.

Need a Hint?
考慮使用數學和幾何特定的資料結構,例如集合或堆疊。
Edge Cases to Watch
  • 空輸入結構
  • 單元素輸入
  • 大數值範圍

準備好解決了嗎?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在編輯器中開啟
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推薦的 Python 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。