LintCode 198: Permutation Index II (有重复元素的permutation index)

198. Permutation Index II
     Given a permutation which may contain repeated numbers, find its index in all the permutations of these numbers, which are ordered in lexicographical order. The index begins at 1.

Example
Example 1:

Input :[1,4,2,2]
Output:3
Example 2:

Input :[1,6,5,3,1]
Output:24

解法1：这题我感觉并不好想。参考的网上思路。
思路：在Permutation Index的基础上，每次针对A[i]加result的时候，应该除以A[i]右侧的累计重复元素数。
以input = {2,2,1,1}为例:
i = 3, A[3] = 1, smallers = 0, um[1] = 1, multiFactorial = 1, result += 0, result = 1, currFactorial = 1,
i = 2, A[2] = 1, smallers = 0, um[1] = 2, multiFactorial = 12 = 2, result += 0, result = 1, currFactorial = 12 = 2
//即当input={1,1}时，reulst=1，因为只有{1,1}这一种组合。

i = 1, A[1] = 2, smallers = 2, um[2] = 1, multiFactorial = 21 = 2, results += 22/2=2, result = 3, currFactorial = 2 * 3 = 6 (n-1=3)
//即当input={2,1,1}时，result=3，因为有{1,1,2}, {1,2,1}, {2,1,1}3种组合。

i = 0, A[0] = 2, smallers = 2, um[2] = 2, multiFactorial = 22 = 4, results += 62/4=3, result = 6, currFactorial = 6 * 4 = 24 (n-0=4)
//即当input={2,2,1,1}时，result = 6, 因为有{1,1,2,2}, {1,2,1,2}, {1,2,2,1}, {2,1,1,2}, {2,1,2,1}, {2,2,1,1}6种组合。

除以multiFactorial比较好理解，因为如果有m个1和n个2在里面的话，result+=currFactorial*smallers/m!n!，因为m!n!个情况只能算一种情况。

注意：

1. result初始值为1，这样若input={1,1,1,1,1}的话至少还有一个permutation。
   同样，currFactorial和multiFactorial初始值都应该为1。

代码如下：

class Solution {
public:
    /**
     * @param A: An array of integers
     * @return: A long integer
     */
    long long permutationIndexII(vector<int> &A) {
         int n = A.size();
        if (n <= 1) return n;
        long long result = 1, currFactorial = 1, multiFactorial = 1;
        unordered_map<int, int> um;
        for (int i = n - 1; i >= 0; --i) {
            int smallers = 0;
            um[A[i]]++;
            multiFactorial *= um[A[i]];
            for (int j = i + 1; j < n; ++j) {
                if (A[j] < A[i]) smallers++;
            }
            result += currFactorial * smallers / multiFactorial;
            currFactorial *= n - i;
        }
        
        return result;
    }
};