Day30-t540-2022-02-14-don't answer by yourself

540 A single element in an ordered array
Give you an ordered array of integers only , Each of these elements will appear twice , Only one number will appear once .

Please find and return the number that only appears once .

The solution you design must meet O(log n) Time complexity and O(1) Spatial complexity .

source ： Power button （LeetCode）
link ：https://leetcode-cn.com/problems/single-element-in-a-sorted-array

class Solution:
    def singleNonDuplicate(self, nums: List[int]) -> int:
        return nums[bisect_left(range(len(nums) - 1), True, key=lambda x: nums[x] != nums[x ^ 1])]

#  author ：himymBen
#  link ：https://leetcode-cn.com/problems/single-element-in-a-sorted-array/solution/pythonjavajavascriptgo-er-fen-cha-zhao-b-l76s/

leetcode It's been a day , Let me slowly …