[Swift]LeetCode1006. 笨阶乘 | Clumsy Factorial

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址： https://www.cnblogs.com/strengthen/p/10504875.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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. 1 <= N <= 10000
2. -2^31 <= answer <= 2^31 - 1  (The answer is guaranteed to fit within a 32-bit integer.)

---

通常，正整数 n 的阶乘是所有小于或等于 n 的正整数的乘积。例如，factorial(10) = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1。

相反，我们设计了一个笨阶乘 clumsy：在整数的递减序列中，我们以一个固定顺序的操作符序列来依次替换原有的乘法操作符：乘法(*)，除法(/)，加法(+)和减法(-)。

例如，clumsy(10) = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1。然而，这些运算仍然使用通常的算术运算顺序：我们在任何加、减步骤之前执行所有的乘法和除法步骤，并且按从左到右处理乘法和除法步骤。

另外，我们使用的除法是地板除法（floor division），所以 10 * 9 / 8 等于 11。这保证结果是一个整数。

实现上面定义的笨函数：给定一个整数 N，它返回 N 的笨阶乘。 

示例 1：

输入：4
输出：7
解释：7 = 4 * 3 / 2 + 1

示例 2：

输入：10
输出：12
解释：12 = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1 

提示：

1. 1 <= N <= 10000
2. -2^31 <= answer <= 2^31 - 1  （答案保证符合 32 位整数。）

---

Runtime: 4 ms

Memory Usage: 18.9 MB

class Solution {    
    func clumsy(_ N: Int) -> Int
    {
        if N == 1 {return 1}
        if N == 2 {return 2}
        if N == 3 {return 3 * 2 / 1}
        return N * (N - 1) / (N - 2) + clumsyInternal(N - 3)      
    }
    
    func clumsyInternal(_ N: Int) -> Int {
        if N == 0 {return 0}
        if N == 1 {return 1}
        if N == 2 {return 1}
        if N == 3 {return 3 - 2 * 1}
        var ans:Int = N - (N - 1) * (N - 2) / (N - 3)
        return ans + clumsyInternal(N - 4)
    }
}

---

 

4ms

class Solution {
    func clumsy(_ n: Int) -> Int {
        if n == 1 {
            return 1
        } else if n == 2 {
            return 2
        } else if n == 3 {
            return 6
        }
        var result = n*(n-1)/(n-2)
        var n = n-3
        while n >= 4 {
            result += n - (n-1)*(n-2)/(n-3)
            n -= 4
        }
        if n > 0 {
            result += 1
        }
        return result
    }
}

---

4ms

class Solution {    
    func clumsy(_ n: Int) -> Int {
        switch n {
            case 1:
                return 1
            case 2:
                return 2
            case 3: 
                return 6
            default:
                return n*(n-1)/(n-2) + clumsyInternal(n-3)
        }
    }
    
    func clumsyInternal(_ n : Int ) -> Int {
        if n >= 4 {
            return n - (n-1)*(n-2)/(n-3) + clumsyInternal(n-4)
        }
        if n == 0 {
            return 0
        }
        return 1
    }
}

---

112ms

class Solution {
    enum Operation: Int {
        case mul
        case div
        case add
        case sub

        func next() -> Operation {
            return Operation(rawValue: (self.rawValue + 1) % 4 )!
        }
    }

    struct OperationCluster {
        var current: Operation {
            return operations[currentIndex]
        }

        var currentIndex: Int

        let operations: [Operation]
        init(operations: [Operation]) {
            self.operations = operations
            self.currentIndex = 0
        }

        mutating func next() {
            currentIndex = (currentIndex + 1) % operations.count
        }
    }

    func clumsy(_ N: Int) -> Int {
        var a = [Int]()

        for i in 0..<N {
            a.append(N-i)
        }

        var multiplied = [Int]()

        var operationCluster = OperationCluster(operations: [.mul, .div, .add, .sub])
        var ignoreNextOperand = false

        for (index, number) in a.enumerated() {
            defer {
                operationCluster.next()
            }

            guard ignoreNextOperand == false else {
                ignoreNextOperand = false
                continue
            }

            switch operationCluster.current {
            case .mul:
                let result = number * (next(in: a, after: index) ?? 1)
                multiplied.append(result)
                ignoreNextOperand = true
            case .div:
                multiplied.append(number)
            case .add:
                multiplied.append(number)
            case .sub:
                multiplied.append(number)
            }
        }

        operationCluster = OperationCluster(operations: [.div, .add, .sub])
        ignoreNextOperand = false

        var divided = [Int]()

        for (index, number) in multiplied.enumerated() {
            defer {
                operationCluster.next()
            }

            guard ignoreNextOperand == false else {
                ignoreNextOperand = false
                continue
            }

            switch operationCluster.current {
            case .mul:
                assertionFailure()
                break
            case .div:
                let result = number / (next(in: multiplied, after: index) ?? 1)
                divided.append(result)
                ignoreNextOperand = true
            case .add:
                divided.append(number)
            case .sub:
                divided.append(number)
            }
        }

        operationCluster = OperationCluster(operations: [.add, .sub])
        ignoreNextOperand = false

        var signApplied = [Int]()

        signApplied.append(divided.first ?? 0)

        for (index, number) in divided.enumerated() {
            defer {
                operationCluster.next()
            }

            guard ignoreNextOperand == false else {
                ignoreNextOperand = false
                continue
            }

            switch operationCluster.current {
            case .mul:
                assertionFailure()
                break
            case .div:
                assertionFailure()
                break
            case .add:
                signApplied.append(next(in: divided, after: index) ?? 0)
            case .sub:
                signApplied.append(-(next(in: divided, after: index) ?? 0))
            }
        }

        return signApplied.reduce(0, +)
    }

    func next(in array: [Int], after index: Int) -> Int? {
        let maxIndex = array.count - 1
        if maxIndex <= index {
            return nil
        }
        return array[index + 1]
    }
}