268. Missing Number

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

五山小新新

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

阅读量386

点赞数

分类专栏： Leetcode 题解

本文链接：https://blog.csdn.net/al_xin/article/details/52304331

版权

Leetcode 题解专栏收录该内容

54 篇文章 0 订阅

订阅专栏

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.

Subscribe to see which companies asked this question

解题思路：这道题目的意思是要找出缺失的那一个值，这里直接就是求和，然后对数组进行减就可以找到缺失的哪个值。

public class Solution {
    public int missingNumber(int[] nums) {
        int len = nums.length;
        if(len == 0)
        {
            return 0;
        }
        int sum = ((len+1)*len) / 2;
        for(int i = 0; i < len; i++)
        {
            sum -= nums[i];
        }
        return sum;

    }
}