short, simple and fast clear solution for Nearest Value by Oksana_Antropova - python coding challenges

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

short, simple and fast solution in Clear category for Nearest Value by Oksana_Antropova

def nearest_value(values: set, one: int) -> int:
    return min((abs(n-one), n) for n in values)[1]

April 9, 2019

Comments:

tanya on April 29, 2019, 6:50 p.m.
good job

Mateu52 on April 3, 2020, 9:20 p.m.
thanks I couldn't find a closer one <pre class='brush: python'>def nearest_value(values,one): sorted(values) #sortujemy tablice znaj=one #szukany element wieksze=one #element for i in values: #print(znaj) if i==one: #taki sam co szukany #print(i) znaj=i break #SOLVED if i<=b: #mniejszy do szukanego #print(i) znaj=i continue return znaj </pre>

afana_daniel on May 4, 2020, 6:48 p.m.
This doesn't pass the test with values {0, -2}

Oksana_Antropova on May 5, 2020, 6:27 a.m.
It does. At least, with all the values of `one` that I've tried.

afana_daniel on May 5, 2020, 2:44 p.m.
I was talking about one of standard checks with values {0, -2} and one -1. My apologize, I didn't test yesterday properly. Your solution is short and simple indeed. Now I'm trying to understand how min() handles multiple iterable arguments. It seems that: 1. The smallest iterable is the one that have the greatest amount of smallest corresponding elements: min([0, 1], [0, -1]) [0, -1] 2. If the amount is equal, min() looks for the order. First elements have higher priority: min([0, -1], [-1, 0]) [-1, 0] This all makes sense. It seems that many of us don't even try to think of comparing iterables. Thanks for a great solution! It's a good lesson.

Oksana_Antropova on May 6, 2020, 10:06 a.m.
Python uses lexicographical order (google it) for `min/max/sort` of iterables. In a nutshell, lexicographical order is the way words are sorted in a dictionary: 'a', 'aa', 'ab', 'bac' and so on.

subin_123 on June 17, 2020, 3:58 a.m.
how does [1] work over here?

Oksana_Antropova on June 17, 2020, 9:40 a.m.
It's just regular indexing. Let's split it into steps and follow them with a simple example ( `values = {7, 10, 11}, one = 9`) : 1) list comprehension `(abs(n-one), n) for n in values` creates a list of tuples `[(2, 7), (1, 10), (2, 11)]` 2) `min` gets the first (lexicographically) tuple: `(1, 10)` 3) finally, with `[1]` we get the element of tuple with index 1 - `10`, which is the correct answer.

subin_123 on June 17, 2020, 4:53 p.m.
thank u for the explanation

krlewis on July 13, 2020, 5:27 p.m.
Great solution

Oksana_Antropova on July 14, 2020, 5:46 a.m.
Thank you! ;-)

veky on Sept. 6, 2020, 1:21 p.m.
Short, yes. Simple, not really. Fast, I'd be surprised. :-) Decorate / min / undecorate (<a href="https://en.wikipedia.org/wiki/Schwartzian_transform)">https://en.wikipedia.org/wiki/Schwartzian_transform)</a> is often used, and natively supported in Python through the `key` argument. When Python does it for you, it's probably faster. :-]

Oksana_Antropova on Oct. 4, 2020, 6:06 a.m.
Good point!

deafborn79 on Feb. 28, 2021, 2:15 p.m.
noice thx

adqq0659 on April 18, 2021, 7:02 a.m.
what does [1] do? I'm bad, need help in understanding

remdch on Sept. 1, 2021, 8:57 p.m.
Is it really great code if so many people (including me) don't understand it? :-)

dhruv.d.tiwari on July 20, 2022, 1:43 p.m.
where did you learn these

Different kind of sets

0 %

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