Leetcode 1333. Filter Restaurants by Vegan-Friendly, Price and Distance [Python]
2021/5/5 1:25:19
本文主要是介绍Leetcode 1333. Filter Restaurants by Vegan-Friendly, Price and Distance [Python],对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
list.sort(key = lambda x: (x[0], x[1]。。。))的用法可以快速解决问题,
class Solution: def filterRestaurants(self, restaurants: List[List[int]], veganFriendly: int, maxPrice: int, maxDistance: int) -> List[int]: cand = [] if veganFriendly == 1: for idx, rest in enumerate(restaurants): if rest[2] == veganFriendly and rest[3] <= maxPrice and rest[4] <= maxDistance: cand.append(rest) else: for idx, rest in enumerate(restaurants): if rest[3] <= maxPrice and rest[4] <= maxDistance: cand.append(rest) cand.sort(key = lambda x:(x[1], x[0]), reverse = True) res = [] for can in cand: res.append(can[0]) return res
不过面试里没准要自己写比较器之类的吧。题目里的餐厅ID不全是1、2、3。。。算是一个坑?。。
这篇关于Leetcode 1333. Filter Restaurants by Vegan-Friendly, Price and Distance [Python]的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-05-08有遇到过吗?同样的规则 Excel 中 比Python 结果大
- 2024-03-30开始python成长之路
- 2024-03-29python optparse
- 2024-03-29python map 函数
- 2024-03-20invalid format specifier python
- 2024-03-18pool.map python
- 2024-03-18threads in python
- 2024-03-14python Ai 应用开发基础训练,字符串,字典,文件
- 2024-03-13id3 algorithm python
- 2024-03-13sum array elements python