LeetCode 50 Pow(x, n)

50. Pow(x, n)

Total Accepted: 87345 Total Submissions: 313212 Difficulty: Medium

Implement pow(x, n).

Subscribe to see which companies asked this question

Have you met this question in a real interview?


class Solution {
public:
    double myPow(double x, int n) {
        return pow(x,n);
    }
};


你可能感兴趣的:(LeetCode 50 Pow(x, n))