1.8 KiB
1.8 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3841000cf542c50fe97 | 5 | Problem 24: Lexicographic permutations | 问题24:字典排列 |
Description
012 021 102 120 201 210
数字0,1,2,3,4,5,6,7,8和9的第n个词典排列是什么? Instructions
Tests
tests:
- text: <code>lexicographicPermutations(699999)</code>应该返回1938246570。
testString: 'assert(lexicographicPermutations(699999) == 1938246570, "<code>lexicographicPermutations(699999)</code> should return 1938246570.");'
- text: <code>lexicographicPermutations(899999)</code>应该返回2536987410。
testString: 'assert(lexicographicPermutations(899999) == 2536987410, "<code>lexicographicPermutations(899999)</code> should return 2536987410.");'
- text: <code>lexicographicPermutations(900000)</code>应该返回2537014689。
testString: 'assert(lexicographicPermutations(900000) == 2537014689, "<code>lexicographicPermutations(900000)</code> should return 2537014689.");'
- text: <code>lexicographicPermutations(999999)</code>应该返回2783915460。
testString: 'assert(lexicographicPermutations(999999) == 2783915460, "<code>lexicographicPermutations(999999)</code> should return 2783915460.");'
Challenge Seed
function lexicographicPermutations(n) {
// Good luck!
return n;
}
lexicographicPermutations(999999);
Solution
// solution required