How to Compute the Clumsy Factorials using Iterative Algorithm?

  • 时间:2020-09-28 16:28:51
  • 分类:网络文摘
  • 阅读:174 次

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.)

Clumsy Factorial Algorithms

Numbers can be proccessed in batches of four. Special cases are the four numbers from N to N-3 and the rest are stored in intermediate variable num, which is (a*b/c-d). Then the num is subtracted from the result.

The remainder items (up to 3) should be also subtracted. The following C++ implements the iterative algorithm that runs at O(N) complexity, and requires O(1) constant space.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
public:
    int clumsyFactorial(int N) {
        int r = 0, c = 0, num = 0;
        for (int i = N; i >= 1; -- i, ++ c) {
            switch (c % 4) {
                case 0:                    
                    num = i; break;
                case 1:
                    num *= i; break;
                case 2:
                    num /= i; break;
                case 3:
                    if (N - i <= 4) r = num + i; else r = r - num + i; break;
            }
        }
        if (N <= 3) return num;
        if (c % 4 != 0) r -= num;
        return r;
    }
};
class Solution {
public:
    int clumsyFactorial(int N) {
        int r = 0, c = 0, num = 0;
        for (int i = N; i >= 1; -- i, ++ c) {
            switch (c % 4) {
                case 0:                    
                    num = i; break;
                case 1:
                    num *= i; break;
                case 2:
                    num /= i; break;
                case 3:
                    if (N - i <= 4) r = num + i; else r = r - num + i; break;
            }
        }
        if (N <= 3) return num;
        if (c % 4 != 0) r -= num;
        return r;
    }
};

–EOF (The Ultimate Computing & Technology Blog) —

推荐阅读:
奥数题:两次相遇地点间相距120千米  数学题:甲乙两仓库共有棉花2600包  百度快照投诉功能恢复正常,新增快照失效类型选项  新网站排名不稳固,三大SEO优化技巧你做到了吗?  SEO优化网站诊断的几个技巧,你知道多少?  bootstrap响应式导航激活高亮,dedecms导航代码分享  为什么自媒体比SEO更火?答案都在这里  发外链还管用么?2020年还能用的外链策略  新网站关键词排名不稳定的原因分析  网站快速收录的方式有哪些 
评论列表
添加评论