Leetcode: 1006. Clumsy Factorial

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:

class Solution {
public:
    int clumsy(int N) {
        if (N <= 4)
            return N == 4 ? 4 * 3 / 2 + 1 :
                   N == 3 ? 3 * 2 :
                   N == 2 ? 2 :
                   N == 1 ? 1 : 0;
        
        int result = N * (N - 1) / (N - 2);
        
        for (int n = N - 4; n >= 3; n -= 4)
            result -= n * (n - 1) / (n - 2);
        
        for (int n = N - 3; n > 0; n -= 4)
            result += n;
        
        return N % 4 == 2 ? result - 2 :
               N % 4 == 1 ? result - 1 : result;
    }
};