LeetCode | 268. Missing Number

最新推荐文章于 2024-10-04 20:45:38 发布

1LOVESJohnny

最新推荐文章于 2024-10-04 20:45:38 发布

阅读量110

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法 c++

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/117432217

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

该博客讨论了一种算法问题，即在一个包含n个不同整数的数组中找到唯独缺失的数字。给定的代码实现了一个解决方案，通过排序数组并遍历来找出缺失的值。在O(n)的时间复杂度和O(1)的空间复杂度下，该方法能够有效找出范围[0,n]内的缺失数。示例展示了不同输入情况下如何找到缺失的数字。

摘要由CSDN通过智能技术生成

题目

Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?

Example 1:

Input: nums = [3,0,1]
Output: 2
Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.
Example 2:

Input: nums = [0,1]
Output: 2
Explanation: n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.
Example 3:

Input: nums = [9,6,4,2,3,5,7,0,1]
Output: 8
Explanation: n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.
Example 4:

Input: nums = [0]
Output: 1
Explanation: n = 1 since there is 1 number, so all numbers are in the range [0,1]. 1 is the missing number in the range since it does not appear in nums.

Constraints:

n == nums.length
1 <= n <= 104
0 <= nums[i] <= n
All the numbers of nums are unique.

代码

class Solution {
public:
    int missingNumber(vector<int>& nums) {
        if(nums.size() == 1)
            return nums[0] == 0? 1:0;
        sort(nums.begin(), nums.end());
        int i;
        for(i = 0; i<nums.size(); i++){
            if(nums[i] != i){
                break;
            }
        }
        return i;
    }
};