leetcode 268. Missing Number

最新推荐文章于 2024-09-14 18:52:56 发布

小雨润如酥

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量155

点赞数

分类专栏： leetcode 文章标签： c语言 leetcode

本文链接：https://blog.csdn.net/zhaihaixu/article/details/75284757

版权

leetcode 专栏收录该内容

120 篇文章 1 订阅

订阅专栏

原题：

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?

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

代码如下:

int missingNumber(int* nums, int numsSize) {
    int cmp(const int*a,const int*b)
    {
        return *(int*)a-*(int*)b;
    }
    qsort(nums,numsSize,sizeof(int),cmp);
    int n=0;
    for(;n<numsSize;n++)
    {
        if(*(nums+n)!=n)
            return n;
    }
    return n;
}

我的思路就是先排序，然后在进行遍历就好了，

最好的方法其实是遍历求和，做差就出来了