Timeline for Make a one sequence
Current License: CC BY-SA 3.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
S Oct 5, 2014 at 22:51 | history | suggested | Alexei Kopylov | CC BY-SA 3.0 |
Small improvements
|
Oct 5, 2014 at 22:27 | review | Suggested edits | |||
S Oct 5, 2014 at 22:51 | |||||
Oct 4, 2014 at 15:21 | history | edited | Johannes Kuhn | CC BY-SA 3.0 |
deleted 8 characters in body
|
Oct 4, 2014 at 15:20 | comment | added | Johannes Kuhn | Interesting. That is even shorter :P | |
Oct 4, 2014 at 10:45 | comment | added | proud haskeller |
because some time has passed, I'll tell you what I meant. You could use mapM(\x->[1,-1])[2..n] instead of sequence and replicate .
|
|
Oct 3, 2014 at 13:41 | history | edited | Johannes Kuhn | CC BY-SA 3.0 |
deleted 20 characters in body
|
Oct 3, 2014 at 13:40 | comment | added | Johannes Kuhn |
head does not return [] for [] :: [[a]] - and I hate errors.
|
|
Oct 3, 2014 at 9:28 | comment | added | proud haskeller |
by the way, you should return only one solution, so you should add head$ to your solution.
|
|
Oct 3, 2014 at 9:26 | comment | added | proud haskeller |
a simple improvement is to change a to an infix function. here's a hint to a more unintuitive improvement: importing Control.Monad just for using replicateM which is already too long. what other monadic function can you use to simulate replicateM ?
|
|
Oct 2, 2014 at 19:39 | history | answered | Johannes Kuhn | CC BY-SA 3.0 |