Leetcode-268. Missing Number

最新推荐文章于 2024-07-29 07:32:50 发布

丶Minskyli

最新推荐文章于 2024-07-29 07:32:50 发布

阅读量746

点赞数

分类专栏：编程学习文章标签： Array c++ leetcode

本文链接：https://blog.csdn.net/qq_31531635/article/details/59581810

版权

编程学习专栏收录该内容

41 篇文章 1 订阅

订阅专栏

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) {
     sort(nums.begin(),nums.end());
     int value[nums.size()]={0},j=0,count=0;
     for(int i=0;i<nums.size();i++)
     {
         if(j<nums.size()&&i<=nums[j])
         {
         if(nums[j]!=i)
         {
             value[count]=i;
             count++;
         }
         else
         {
             j++;
         }
         }
     }
         if(count==0)
         {
             return nums.size();
         }
         else
         {
         for(int i=0;i<nums.size();i++)
         {
             return value[i];
         }
         }

    }

};