zoukankan      html  css  js  c++  java
  • Lintcode: 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.
    
    Have you met this question in a real interview? Yes
    Example
    Given the permutation [1, 4, 2, 2], return 3.

    这里需要考虑重复元素,有无重复元素最大的区别在于原来的1!, 2!, 3!...等需要除以重复元素个数的阶乘。记录重复元素个数同样需要动态更新,引入哈希表这个万能的工具较为方便。

    按照从数字低位到高位进行计算

     1 public class Solution {
     2     /**
     3      * @param A an integer array
     4      * @return a long integer
     5      */
     6     public long permutationIndexII(int[] A) {
     7         // Write your code here
     8         if (A==null || A.length==0) return new Long(0);
     9         int len = A.length;
    10         HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
    11         long index = 0, fact = 1, mulFact = 1;
    12         for (int i=len-1; i>=0; i--) {
    13             if (!map.containsKey(A[i])) {
    14                 map.put(A[i], 1);
    15             }
    16             else {
    17                 map.put(A[i], map.get(A[i])+1);
    18                 mulFact *= map.get(A[i]);
    19             }
    20             int count = 0;
    21             for (int j=i+1; j<len; j++) {
    22                 if (A[i] > A[j]) count++;
    23             }
    24             index += count*fact/mulFact;
    25             fact *= (len-i);
    26         }
    27         index = index + 1;
    28         return index;
    29     }
    30 }
  • 相关阅读:
    $.unique()去重问题
    js判断中文
    js URL中文传参乱码
    zabbix添加nginx监控
    TCP/IP与OSI参考模型原理
    100个linux系统常用指令
    read指令使用方法
    grep与正则表达式使用
    shell脚本中case的用法
    shell脚本:变量,文件判断,逻辑运算等纪要
  • 原文地址:https://www.cnblogs.com/EdwardLiu/p/5104409.html
Copyright © 2011-2022 走看看