Leetcode——268. Missing Number

题目原址

https://leetcode.com/problems/missing-number/description/

题目描述

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

Example1:

Input: [3,0,1]
Output: 2

Example2:

Input: [9,6,4,2,3,5,7,0,1]
Output: 8

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

解题思路

题意比较好理解，就是给[1,n]数组，找到其中确实的一个数，该题与之前的题不同之处在于，数组中的数不重复，因此只需要将数组中的数进行累加，然后与求和公式：（1+长度）*长度/2做差即可，差得的结果就是丢失的数。

AC代码

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

感谢

https://discuss.leetcode.com/topic/22299/java-solution-o-1-space-and-o-n-in-time