Given a sorted array consisting of only integers where every element appears twice except for one element which appears once. Find this single element that appears only once. Example 1: Input: [1,1,2,3,3,4,4,8,8] Output: 2  Example 2: Input: [3,3,7,7…

这道题目的要求,Note: Your solution should run in O(log n) time and O(1) space. 因此应该用二分查找的方式,代码如下: class Solution: def singleNonDuplicate(self, nums: 'List[int]') -> int: l = 0 h = len(nums)-1 while l<h: m = l + (h-l)//2 if m%2==1: m-=1 if nums[m] == nums[m…