Timeline for Build a list from a depth map
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 24, 2022 at 15:54 | comment | added | Jonah | Very, very nice! Shaved off 22 bytes for my J solution. | |
| Jan 24, 2022 at 15:53 | history | edited | Jonah | CC BY-SA 4.0 | added 520 characters in body |
| Jan 24, 2022 at 7:58 | comment | added | ovs | Found a better approach. | |
| Jan 24, 2022 at 7:14 | history | edited | Jonah | CC BY-SA 4.0 | deleted 224 characters in body |
| Jan 23, 2022 at 23:56 | comment | added | Jonah | Yes, I considered that and think it’s conceptually more elegant. Maybe I’ll try tomorrow and see if it’s shorter. Thanks for looking | |
| Jan 23, 2022 at 23:53 | comment | added | ovs | No J code, but maybe an idea for a slightly different (recursive) meld step: Group adjacent boxes (keeping scalar integers separated); For each of those groups: Concatenate the boxes and recursively call on the result. I'm not completely sure if this works correctly and is shorter to implement, but it shouldn't need the L:. | |
| Jan 23, 2022 at 21:19 | history | undeleted | Jonah | ||
| Jan 23, 2022 at 21:19 | history | edited | Jonah | CC BY-SA 4.0 | added 328 characters in body |
| Jan 23, 2022 at 15:52 | history | deleted | Jonah | via Vote | |
| Jan 23, 2022 at 15:50 | history | answered | Jonah | CC BY-SA 4.0 |