Advertisement
kosievdmerwe

Untitled

Nov 19th, 2021
108
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.36 KB | None | 0 0
  1. class Solution:
  2.     def singleNonDuplicate(self, nums: List[int]) -> int:
  3.         N = len(nums)
  4.         b, e = 0, N // 2
  5.         ans = nums[-1]
  6.         while b < e:
  7.             m = (b + e) // 2
  8.             if nums[2 * m] == nums[2 * m + 1]:
  9.                 b = m + 1
  10.             else:
  11.                 ans = nums[2 * m]
  12.                 e = m
  13.         return ans
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement