LeetCode Solutions/Binary Search/Pow(x, n)/Pow(x, n).java
<reponame>DevashishPathrabe/LeetCode<filename>LeetCode Solutions/Binary Search/Pow(x, n)/Pow(x, n).javaclass Solution {
    public double myPow(double x, int n) {
        return Math.pow(x, n);
    }
}