mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-25 04:30:15 +00:00
267b5eff40
* Added doctest and more explanation about Dijkstra execution. * tests were not passing with python2 due to missing __init__.py file at number_theory folder * Removed the dot at the beginning of the imported modules names because 'python3 -m doctest -v data_structures/hashing/*.py' and 'python3 -m doctest -v data_structures/stacks/*.py' were failing not finding hash_table.py and stack.py modules. * Moved global code to main scope and added doctest for project euler problems 1 to 14. * Added test case for negative input. * Changed N variable to do not use end of line scape because in case there is a space after it the script will break making it much more error prone. * Added problems description and doctests to the ones that were missing. Limited line length to 79 and executed python black over all scripts. * Changed the way files are loaded to support pytest call. * Added __init__.py to problems to make them modules and allow pytest execution. * Added project_euler folder to test units execution * Changed 'os.path.split(os.path.realpath(__file__))' to 'os.path.dirname()'
28 lines
762 B
Python
28 lines
762 B
Python
"""
|
|
A permutation is an ordered arrangement of objects. For example, 3124 is one
|
|
possible permutation of the digits 1, 2, 3 and 4. If all of the permutations
|
|
are listed numerically or alphabetically, we call it lexicographic order. The
|
|
lexicographic permutations of 0, 1 and 2 are:
|
|
|
|
012 021 102 120 201 210
|
|
|
|
What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5,
|
|
6, 7, 8 and 9?
|
|
"""
|
|
from itertools import permutations
|
|
|
|
|
|
def solution():
|
|
"""Returns the millionth lexicographic permutation of the digits 0, 1, 2,
|
|
3, 4, 5, 6, 7, 8 and 9.
|
|
|
|
>>> solution()
|
|
'2783915460'
|
|
"""
|
|
result = list(map("".join, permutations("0123456789")))
|
|
return result[999999]
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution())
|