Timeline for Parse a Baseball Pitch String
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 31, 2020 at 8:03 | comment | added | ceilingcat | 119 bytes | |
| Apr 28, 2020 at 0:02 | comment | added | KaleSurfer | Thanks Kevin, I just saw this, I'll check it out, and improve my answer! | |
| Apr 20, 2020 at 9:43 | comment | added | Kevin Cruijssen | Also, if you haven't seen it yet, tips for golfing in C# and tips for golfing in <all languages> might both be interesting to read through. Enjoy your stay! :) | |
| Apr 20, 2020 at 9:43 | comment | added | Kevin Cruijssen |
Hi, welcome to CGCC! If you're using a recursive method, the d= should be counted towards the byte-count as well, so this is actually 149 bytes. But, you can golf this to 122 bytes by nesting ternary-ifs; changing the characters to code-point integers for the checks; and changing all || and && to | and & respectively (except for the || in P=='S'||(P=='F'&&s<2), since we need it to get rid of the parenthesis).
|
|
| Apr 19, 2020 at 11:45 | review | First posts | |||
| Apr 19, 2020 at 11:46 | |||||
| Apr 19, 2020 at 11:43 | history | answered | KaleSurfer | CC BY-SA 4.0 |