Zeitpunkt Nutzer Delta Tröts TNR Titel Version maxTL Mo 17.06.2024 00:00:18 61.885 +3 3.472.512 56,1 Fosstodon 4.2.9 500 So 16.06.2024 00:00:10 61.882 -1 3.470.177 56,1 Fosstodon 4.2.9 500 Sa 15.06.2024 00:00:08 61.883 0 3.467.604 56,0 Fosstodon 4.2.9 500 Fr 14.06.2024 00:00:14 61.883 +4 3.464.785 56,0 Fosstodon 4.2.9 500 Do 13.06.2024 00:00:16 61.879 +4 3.462.150 56,0 Fosstodon 4.2.9 500 Mi 12.06.2024 00:00:10 61.875 0 3.458.856 55,9 Fosstodon 4.2.9 500 Di 11.06.2024 00:01:08 61.875 +2 3.455.916 55,9 Fosstodon 4.2.9 500 Mo 10.06.2024 00:01:10 61.873 +1 3.452.718 55,8 Fosstodon 4.2.9 500 So 09.06.2024 00:01:08 61.872 +2 3.449.942 55,8 Fosstodon 4.2.9 500 Sa 08.06.2024 00:00:08 61.870 0 3.447.147 55,7 Fosstodon 4.2.9 500
Mirek Długosz 🕸️:python:🐛 (@mirekdlugosz) · 11/2022 · Tröts: 347 · Folger: 140
Mo 17.06.2024 21:01
The Bus Route task in today #PerlWeeklyChallenge was surprisingly difficult, but I had fun thinking about it. I uploaded my solution to GitHub.
There are few obvious optimizations I have not pursued (storing only the minimum arrival time instead of list, taking advantage of result not changing until current minute passes departure time, taking advantage of fact that next-after-closest becomes closest once current minute passes departure time).
https://github.com/mirekdlugosz/theweeklychallenge/commit/2136f592c0c70533e19ab8bc185b22ef46738ec9
[Öffentlich] Antw.: 0 Wtrl.: 0 Fav.: 0