Leetcode-268 Missing Number

Posted 北冥有鱼,南冥有猫

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode-268 Missing Number相关的知识,希望对你有一定的参考价值。

#268.  Missing Number

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

For example,
Given nums = [0, 1, 3] return 2.

Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?

class Solution {
public:
    int missingNumber(vector<int>& nums) {
        int len=nums.size();
        int ret=0;
        for(int i=0;i<len+1;i++)
        {
            ret^=i;
        }
        for(int i=0;i<len;i++)
        {
            ret^=nums[i];
        }
        return ret;
    }
};

 



以上是关于Leetcode-268 Missing Number的主要内容,如果未能解决你的问题,请参考以下文章

leetcode268 - Missing Number - easy

LeetCode 268. Missing Number

Leetcode 268: Missing Number

Leetcode 268 Missing Number 位运算

leetcode 268. Missing Number

leetcode 268 Missing Number(异或运算的应用)