You are given a sorted array of integers, nums, where all integers appear twice except for one. Your task is to find and return the single integer that appears only once.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results