We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 14af000 commit 81baed0Copy full SHA for 81baed0
python/0853-car-fleet.py
@@ -4,7 +4,7 @@ def carFleet(self, target: int, position: List[int], speed: List[int]) -> int:
4
pair.sort(reverse=True)
5
stack = []
6
for p, s in pair: # Reverse Sorted Order
7
- stack.append((target - p) / s)
8
- if len(stack) >= 2 and stack[-1] <= stack[-2]:
9
- stack.pop()
+ t = (target - p) / s
+ if not stack or t > stack[-1]:
+ stack.append(t)
10
return len(stack)
0 commit comments