Single Element in a Sorted Array问题及解法

最新推荐文章于 2020-02-25 15:32:06 发布

我们要爱学习

最新推荐文章于 2020-02-25 15:32:06 发布

阅读量398

点赞数

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Medium BS

本文链接：https://blog.csdn.net/u011809767/article/details/77447013

版权

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章 1 订阅

订阅专栏

问题描述：

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.

示例：

Input: [1,1,2,3,3,4,4,8,8]
Output: 2

Input: [3,3,7,7,10,11,11]
Output: 10

问题分析：

查找类问题可考虑用二分查找法。

过程详见代码：

class Solution {
public:
    int singleNonDuplicate(vector<int>& nums) {
        int left = 0;
		int right = nums.size() - 1;
        int n;
		int mid;
		while (left < right)
		{
			mid = (left + right) / 2;
            n = (right - left) / 2 % 2;
			if (nums[mid] < nums[mid + 1] && nums[mid] > nums[mid - 1]) return nums[mid];
			else if (nums[mid] == nums[mid - 1])
			{
				if(n)
                {
                    left = mid + 1;
                }
                else right = mid - 2;
			}
			else if (nums[mid] == nums[mid + 1])
			{
				if(n)
                {
                    right = mid - 1;
                }
                else left = mid + 2;
			}
		}
		return nums[left];
    }
};