Better way to find a minimum value that fits a condition?

久未见 提交于 2019-12-05 20:11:17

You could do:

max(candidates[candidates<limit])

Which first filters out just those candidates that are (strictly) less than the limit, and then takes the max of those (which much be the closest).

I'm sure there are other ways too.

标签
易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!