First clear solution for The Most Numbers by panaro32 - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First solution in Clear category for The Most Numbers by panaro32

def checkio(*t):
    return len(t) and max(t)-min(t)

May 11, 2014

Comments:

maurice.makaay on Nov. 3, 2014, 7:40 a.m.
Returning 0 on an empty list is a bit hidden in this solution. Of course it works, but it is less explicit than the solutions that do "max(t)-min(t) if t else 0".

gotoloop on Nov. 16, 2014, 6:27 a.m.
Most succinct here ever! :D

jam on Nov. 17, 2014, 7:25 p.m.
Mystic...

lesenv on Nov. 18, 2014, 11:09 p.m.
i love it! the "len(t) and"-trick is a new one to me. thanks

e.roboda on Dec. 10, 2014, 6:42 p.m.
Creative !

M157q on Nov. 5, 2015, 7:41 a.m.
great for using <a href="https://en.wikipedia.org/wiki/Short-circuit_evaluation">short-ciruit evaluation</a>!

jake-g on Feb. 22, 2016, 4:03 a.m.
i like this one

ghostishev on May 10, 2016, 10:05 a.m.
very interesting solution

lohetvr on Jan. 4, 2017, 5:44 p.m.
This is an interesting way to think - the use of logic operators and the max,min functions!

alekseykonotop on Sept. 22, 2018, 8:22 a.m.
Yes, this solution is more difficult to understand, but if you think about it, everything becomes obvious.

maggalus on Nov. 7, 2019, 8:38 p.m.
Please, explain this solution. How does it work?

cyborg.raczyn on Nov. 16, 2019, 8:55 a.m.
Good job but using len(t) in this situation is not recommended, why? ask Guido or guide ;-). If we use recommended t (to be honest i didn't test ) instead len(t) code should work an be more pythonic.

temp681865 on March 25, 2020, 2:46 p.m.
<pre class='brush: python'>>>> a = lambda *t: t and max(t) - min(t) >>> print(a()) () </pre> I think you wanted this: <pre class='brush: python'>>>> a = lambda *t: int(bool(t)) and max(t) - min(t) >>> print(a()) 0 </pre>

Ice Base

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!