[Stack]853. Car Fleet, Medium

最新推荐文章于 2024-06-12 10:00:23 发布

QQ_VV

最新推荐文章于 2024-06-12 10:00:23 发布

阅读量97

点赞数

分类专栏： Stack leetcode 文章标签： leetcode 算法数据结构 python

本文链接：https://blog.csdn.net/QQ_VV/article/details/128623722

版权

leetcode 同时被 2 个专栏收录

9 篇文章 0 订阅

订阅专栏

Stack

6 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/car-fleet/

fastSort nlogn time, logn space

class Solution:
    def carFleet(self, target: int, position: List[int], speed: List[int]) -> int:
        z = []
        for x, y in zip(position, speed):
            z.append((x,y))
        z.sort(key = lambda a: -a[0])
        # z = sorted(zip(position,speed),key = lambda x: -x[0])
        fleets = []
        for x,y in z:
            # print(fleets)
            hour = (target - x)/y
            if not fleets or fleets[-1]<hour:
                fleets.append(hour)
        return len(fleets)