菜鸟的每日力扣系列——540. 有序数组中的单一元素（#Day37）

from typing import List


def singleNonDuplicate(nums: List[int]) -> int:
    left, right, next_index = 0, len(nums)-1, 0
    while left < right:
        mid = (left + right) // 2
        next_index = mid + 1 if mid % 2 == 0 else mid -1  # 只可能出现在奇数个数的部分
        if nums[mid] == nums[next_index]:
            left = mid + 1
        else:
            right = mid
    return nums[left]


nums = [1,1,2,3,3,4,4,8,8]
print(singleNonDuplicate(nums))  # 2

package main

import "fmt"

func singleNonDuplicate(nums []int) int {
  left, right := 0, len(nums)-1
  next_index := 0
  for left < right {
    mid := (left + right) / 2
    if mid%2 == 0 {
      next_index = mid + 1
    } else {
      next_index = mid - 1
    }
    if nums[mid] == nums[next_index] {
      left = mid + 1
    } else {
      right = mid
    }
  }
  return nums[left]

}

func main() {
  var nums = []int{1, 1, 2, 3, 3, 4, 4, 8, 8}
  fmt.Println(singleNonDuplicate(nums)) // 2
}