Given a list of unsorted numbers, I want to find the smallest number larger than N (if any).
In C#, I'd do something like this (checks omitted) :
var x = list.Where(i => i > N).Min();
What's a short, READABLE way to do this in Python?
asked Jul 19, 2010 at 14:21
Cristian Diaconescu
35.9k32 gold badges149 silver badges239 bronze badges
-
1What do you mean by "READABLE"?S.Lott– S.Lott2010-07-19 14:55:48 +00:00Commented Jul 19, 2010 at 14:55
-
@SLott "read·a·ble/ˈrēdəbəl/: (2) Easy or enjoyable to read." What do you mean by "What do you mean by readable?" ?Cristian Diaconescu– Cristian Diaconescu2010-07-21 14:40:27 +00:00Commented Jul 21, 2010 at 14:40
Add a comment
|
4 Answers
>>> l = [4, 5, 12, 0, 3, 7]
>>> min(x for x in l if x > 5)
7
Comments
min(x for x in mylist if x > N)
Comments
Other people have given list comprehension answers. As an alternative filter is useful for 'filtering' out elements of a list.
min(filter(lambda t: t > N, mylist))
2 Comments
Xavier Combelle
using filter is a little bit slower than using generator expressions
Cristian Diaconescu
+1. I've asked this question partly to improve my Python skills, so this answer serves my purpose quite well.
x = min(i for i in mylist if i > N)
