DeepRest

Single Element in a Sorted Array

Nov 20th, 2021 (edited)
107
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.44 KB | None | 0 0
  1. class Solution(object):
  2.     def singleNonDuplicate(self, nums):
  3.         """
  4.        :type nums: List[int]
  5.        :rtype: int
  6.        """
  7.         beg = 0
  8.         end = len(nums) - 1
  9.         mid = 2*((end-beg)//4) + beg
  10.         while(beg < end):
  11.             if nums[mid] != nums[mid + 1]:
  12.                 end = mid
  13.             else:
  14.                 beg = mid + 2
  15.             mid = 2*((end-beg)//4) + beg
  16.        
  17.         return nums[beg]
Add Comment
Please, Sign In to add comment