Get a random n digit number with distinct digits and first not a 0 I read this question and thought it would make a nice challenge.
Task
Give an input 0&lt;n&lt;10 generate a random number with

exactly n digits
the first not a 0

so f(n)&gt;10**(n-1)-1


distinct digits

Winning criteria
This is code-golf so shortest code wins.
Random
I mean evenly distributed random. So from the view of the program each possible number has the same chance. If the language you're writing in has a weird random number generator, it's okay to use that one.
Example
The list of values to randomly select from for n=2 is:
[10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98]
Python 2, 77 bytes



from random import*
r=range(10)
while[1]&gt;r:shuffle(r)
print`r`[1:input()*3:3]


Try it online!

Shuffles the list of 10 digits until it doesn't start with 0, then makes a number with the first n digits listed.