From 7d38ee51ceaf40a4ae406080de5af9e18bf13731 Mon Sep 17 00:00:00 2001 From: ImAlpha Date: Mon, 2 Oct 2023 03:30:30 -0700 Subject: [PATCH] solved using v = d/t --- NeetCodeRoadmap/Stack/853_Car_Fleet.py | 26 +++++++++++++++++---- NeetCodeRoadmap/Stack/tempCodeRunnerFile.py | 3 ++- 2 files changed, 24 insertions(+), 5 deletions(-) diff --git a/NeetCodeRoadmap/Stack/853_Car_Fleet.py b/NeetCodeRoadmap/Stack/853_Car_Fleet.py index c38db82..cf5d406 100644 --- a/NeetCodeRoadmap/Stack/853_Car_Fleet.py +++ b/NeetCodeRoadmap/Stack/853_Car_Fleet.py @@ -21,10 +21,28 @@ class Solution(object): :type speed: List[int] :rtype: int """ - fleets = [] - for i,p in enumerate(position): - print(f'{i}: {p}') + n = len(speed) + # Create velocity with position and speed + v = [(position[i], speed[i]) for i in range(n)] + v.sort() + # Get Time based on displacement(distance from target) and speed + time = [float(target - v[i][0]) / v[i][1] for i in range(n)] + + curr = float('-inf') + res = 0 + + # Find each fastest time of arrival per fleet based on new current time + for i in range(n - 1, -1, -1): + if time[i] > curr: + print(f'curr is {curr}: time is {time[i]}') + curr = time[i] + res += 1 + + return res + obj = Solution() -print(obj.carFleet(12,[10,8,0,5,3],[2,4,1,1,3])) # 3 \ No newline at end of file +print(obj.carFleet(12,[10,8,0,5,3],[2,4,1,1,3])) # 3 +print(obj.carFleet(10,[3],[3])) # 1 +print(obj.carFleet(100,[0,2,4],[4,2,1])) # 1 \ No newline at end of file diff --git a/NeetCodeRoadmap/Stack/tempCodeRunnerFile.py b/NeetCodeRoadmap/Stack/tempCodeRunnerFile.py index 9b26d4f..4459339 100644 --- a/NeetCodeRoadmap/Stack/tempCodeRunnerFile.py +++ b/NeetCodeRoadmap/Stack/tempCodeRunnerFile.py @@ -1 +1,2 @@ -0]*len(temperatures) \ No newline at end of file +print(obj.carFleet(10,[3],[3])) # 1 +print(obj.carFleet(100,[0,2,4],[4,2,1])) # 1 \ No newline at end of file