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 498e85a commit 2125343Copy full SHA for 2125343
Python/longest-increasing-subsequence.py
@@ -27,7 +27,7 @@ def insert(target):
27
left, right = 0, len(LIS) - 1
28
# Find the first index "left" which satisfies LIS[left] >= target
29
while left <= right:
30
- mid = int(left + (right - left) / 2)
+ mid = left + (right - left) // 2
31
if LIS[mid] >= target:
32
right = mid - 1
33
else:
0 commit comments