Timeline for Find the First Bracket Match
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 28, 2017 at 18:37 | history | edited | Riley | CC BY-SA 3.0 |
added 130 characters in body
|
| Apr 28, 2017 at 18:28 | comment | added | Adnan |
Just messing around with the ASCII values. Note that after incrementing, the second last bit is 0 for an opening bracket and 1 for an closing bracket.
|
|
| Apr 28, 2017 at 18:28 | history | edited | Riley | CC BY-SA 3.0 |
deleted 8 characters in body
|
| Apr 28, 2017 at 18:21 | comment | added | Adnan |
For 10 bytes: Ç>2&<.pO0k.
|
|
| Apr 28, 2017 at 17:52 | history | edited | Riley | CC BY-SA 3.0 |
added 36 characters in body
|
| Apr 28, 2017 at 17:31 | comment | added | Magic Octopus Urn |
žu8ÝÈÏ so, no, not really lol. At best it will still be 5 bytes. I was thinking more of split into the pairs of braces, and remove braces until there's only one pair left, increment counter by 2 for each removed pair. I have no idea if that's less though. Trying it out atm.
|
|
| Apr 28, 2017 at 17:28 | comment | added | Magic Octopus Urn |
žu seems usable here.
|
|
| Apr 28, 2017 at 17:26 | history | answered | Riley | CC BY-SA 3.0 |