优化具有重复项的未排序算法
[英]Optimize unranking algorithmn with duplicates
问题描述
is it possible to optimize the given unrank with duplicates O(n^2) algorithm to a lower complexity level, if yes how?
是否可以使用重复O(n^2)算法将给定的 unrank 优化到较低的复杂度级别，如果可以，如何？
The algorithm is given by this Link:该算法由此链接给出：
https://www.geeksforgeeks.org/find-n-th-lexicographically-permutation-string-set-2/ https://www.geeksforgeeks.org/find-n-th-lexicographically-permutation-string-set-2/
0 个解决方案
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.
相关问题
优化重复平方算法 - Optimize a repeated squaring algorithmn
对重复次数有限的无等级组合进行排名（工厂等级） - ranking unranking combinations with limited duplicates (factoradic rank)
使用重复项优化大型列表的python循环 - Optimize python loop for large list with duplicates
优化删除重复和使用 groupby pandas - Optimize removing duplicates and using groupby pandas
如何优化两个元组列表的组合并删除其重复项？ - How to optimize the combination of 2 lists of tuples and remove their duplicates?
区域提案标准化的最快算法 - Quickest Algorithmn for Normalization of Region Proposals
Python 二进制搜索算法返回无 - Python binary search algorithmn returns None
如何在装箱算法中将小矩形重新排列为大矩形 - How to rearrange the small rectangular into a big rectangular in bin packing algorithmn
如何优化具有两个元素的列表之间的交集，并在python中生成没有重复的列表列表？ - How can I optimize the intersections between lists with two elements and generate a list of lists without duplicates in python?
显示重复项和重复项数 - Displaying Duplicates and the number of duplicates
相关标签