Timeline for N(e(s(t))) a string
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 19, 2016 at 1:29 | history | edited | anna328p | CC BY-SA 3.0 |
added 72 characters in body
|
| Oct 19, 2016 at 0:38 | comment | added | Value Ink | And then I realize that these standard optimizations causes it to be exactly like @m-chrzan's answer, and now this is a tad awkward | |
| Oct 19, 2016 at 0:36 | comment | added | Value Ink |
size is more efficient than length, and multiplying an array by a string does an implicit join. And finally, (x-1) can be substituted to ~-x. Combining with Lee W suggestions, you end up with ->s{(s.chars*?()+?)*~-s.size} for 29 bytes!
|
|
| Oct 18, 2016 at 19:17 | history | edited | anna328p | CC BY-SA 3.0 |
edited body
|
| Oct 18, 2016 at 19:16 | comment | added | Lee W |
chars is more efficient than split, and I believe you want s.length-1
|
|
| Oct 18, 2016 at 18:44 | history | answered | anna328p | CC BY-SA 3.0 |