Return to Answer

-7 bytes

Source Link

edited Jul 27, 2017 at 13:17

Haskell, 3939 32 bytes

No for loops/recursion at all, makes use of list comprehension and [a..b] which is equivalent to Python's range(a,b+1):

[[1..x]++tail(reverse[1x]++[x-1,x-2..x])|x<1]|x<-[1..9]]

No for loops/recursion at all, makes use of list comprehension and [a..b] which is equivalent to Python's range(a,b+1):

[[1..x]++tail(reverse[1..x])|x<-[1..9]]

No for loops/recursion at all, makes use of list comprehension:

[[1..x]++[x-1,x-2..1]|x<-[1..9]]

Source Link

created Jul 27, 2017 at 13:09

No for loops/recursion at all, makes use of list comprehension and [a..b] which is equivalent to Python's range(a,b+1):

[[1..x]++tail(reverse[1..x])|x<-[1..9]]