Re:Python’s tug of war between beginner-friendly and advance...
by floxy on Thursday February 04, 2021 @08:32PM
(#26032014)
FWIW, it was easier to me to follow your intent with the second example. The only clunky thing about is was the zip followed by the comprehension. It might be slightly nicer with something like:
...using something like numpy. I wonder if APL/J has successive element operator.
[ Parent
| on HN ]
Re:Python’s tug of war between beginner-friendly and advance...
by ahgamut on Thursday February 04, 2021 @10:34PM
(#26032784)
J has the verbs behead[0] (for xs[1:]) and curtail[1] (for xs[:-1]), so the J oneliner for the above code would be
<./ ([&}. - }:) xs
[0] https://code.jsoftware.com/wiki/Vocabulary/curlyrtdot
[1] https://code.jsoftware.com/wiki/Vocabulary/curlyrtco
Re:Python’s tug of war between beginner-friendly and advance...
by floxy on Friday February 05, 2021 @07:11PM
(#26042824)
Thanks. The "right way" to do max of the differences (with the sort) in J might be something like?
>./-2-/\/:~ xs
Re:Python’s tug of war between beginner-friendly and advance...
by adamjb on Thursday February 04, 2021 @09:33PM
(#26032391)
If you're gonna bring numpy into it you may as well use np.diff():
def maxWidthOfVerticalArea(self, points: List[List[int]]) -> int:
return np.diff(sorted(x for x, _ in points)).max()