Leetcode Missing Number 268

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.

考虑线性时间同时空间尽可能小

遍历一遍 求和

public class Solution { 

    public int missingNumber(int[] nums) { 

        int len = nums.length; 

        int sum = 0; 

        for(int i = 0;i < len; i++){ 

            sum += nums[i]; 

        } 

        int ans = (len + 1) * len / 2 - sum; 

        return ans; 

    } 

}

考虑数组很大的时候