Normally, the factorial of a positive integer n
is the product of all positive integers less than or equal to n
. For example, factorial(10) = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1
.
We instead make a clumsy factorial: using the integers in decreasing order, we swap out the multiply operations for a fixed rotation of operations: multiply (*), divide (/), add (+) and subtract (-) in this order.
For example, clumsy(10) = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1
. However, these operations are still applied using the usual order of operations of arithmetic: we do all multiplication and division steps before any addition or subtraction steps, and multiplication and division steps are processed left to right.
Additionally, the division that we use is floor division such that 10 * 9 / 8
equals 11
. This guarantees the result is an integer.
Implement the clumsy
function as defined above: given an integer N
, it returns the clumsy factorial of N
.
Example 1:
Input: 4 Output: 7 Explanation: 7 = 4 * 3 / 2 + 1
Example 2:
Input: 10 Output: 12 Explanation: 12 = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1
Note:
1 <= N <= 10000
-2^31 <= answer <= 2^31 - 1
(The answer is guaranteed to fit within a 32-bit integer.)
Solution: Simulation
Time complexity: O(n)
Space complexity: O(1)
C++
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
// Author: Huahua 4ms 8.2 MB class Solution { public: int clumsy(int N) { if (N <= 0) return 0; if (N == 1) return 1; if (N == 2) return 2 * 1; if (N == 3) return 3 * 2 / 1; int ans = N * (N - 1) / (N - 2) + (N - 3); while ((N -= 4) >= 4) ans = ans - N * (N - 1) / (N - 2) + (N - 3); return ans - clumsy(N); } }; |
请尊重作者的劳动成果,转载请注明出处!花花保留对文章/视频的所有权利。
如果您喜欢这篇文章/视频,欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Be First to Comment