Wouldn't this code fail in a case like this? Because you count different lines, not different characters in the lines, right? Or am I missing something? Thanks (Let's ignore column symmetry for the sake of example).
##
..
..
..
(I think you will get answer 100, but the answer is 300)
But for sure after seeing this I have to learn Scala.
Was lazy at the beginning, so I started to do actual expansion in memory, then decided to do it properly. And it paid off in the second part.
Double expansion seams like a nice approach, but I didn't think of that. Instead, I just scan the lines and โrememberโ if I am in a component or not by counting the number of pipe crossings.
That's looking quite promising. The main thing missing before being ready for me is filter/add by region and of course shop name. Then it can go out i think (+ give me a random code feature as the next step).
And make a new post with this, no one will notice otherwise (if you haven't already)
This is the same thing as in chrome
Shut up and take my money!
I got snake arms ๐
Yep, me as a small child.
Oh, I missed that ๐
Reading this on Infinity for lemmy
Oh, I see, I for some reason switched zip operation with โcreate pair/tupleโ operation in my head. Thanks for clarification.