LeetCode 12 May, Single Element in a Sorted Array, 找出独数

Single Element in a Sorted Array

You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly 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, 10, 11, 11]

Output: 10

Note: Your solution should run in O(log n) time and O(1) space.

分析:

本题主要利用逻辑位运算中的异或运算,详细信息可以参考另一个博文查找单独数

Python3 代码如下:

# 方法一
# Runtime: 68ms
# Memory Usage: 16MB
class Solution:
    def singleNonDuplicate(self, nums: List[int]) -> int:
        mark = 0
        for x in nums:
            mark = mark ^ x
        return mark
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值