Leetcode 50. Pow(x, n)

Compute x raised to the integer power n (n may be negative and within 32-bit bounds), returning a double. The challenge is to handle negative exponents and large magnitude n efficiently using binary/exponentiation-by-squaring in O(log |n|) time while avoiding edge-case overflow (e.g., n = INT_MIN).