Leet Code 50 Pow(x, n) - 实现幂运算 - Java
2016-06-23 00:00
239 查看
摘要: Leet Code 50 Pow(x, n) - 实现幂运算 - Java
问题原始链接 https://leetcode.com/problems/powx-n
实现 Pow(x, n)。
思路:二分法。令 half = Pow(x, n/2),如果 n 为偶数,则结果为 half*half,如果n为奇数,则结果为 half*half*x。
问题原始链接 https://leetcode.com/problems/powx-n
实现 Pow(x, n)。
思路:二分法。令 half = Pow(x, n/2),如果 n 为偶数,则结果为 half*half,如果n为奇数,则结果为 half*half*x。
public class Solution { public static double myPow(double x, int n) { if (x == 1 || n == 0) { return 1; } if (x == 0) { return 0; } if (n == 1) { return x; } if (n > 0) { double half = myPow(x, n / 2); return (n & 1) == 1 ? half * half * x : half * half; } else { if (n == Integer.MIN_VALUE) { return 1 / (myPow(x, Integer.MAX_VALUE) * x); } else { return 1 / myPow(x, Math.abs(n)); } } } }
相关文章推荐
- 与Math.pow 相反的函数使用介绍
- JavaScript中的pow()方法使用详解
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解