LeetCode/Java/268.java at master · strengthen/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
    public int missingNumber(int[] nums) {
        int sum=0;
        for(int n: nums)
            sum += n;
        return nums.length*(nums.length+1)/2-sum;

    }
}
__________________________________________________________________________________________________
sample 36644 kb submission
class Solution {
    public int missingNumber(int[] nums) {

        int sum = 0;
        for(int n:nums)
        {
             sum+=n;
        }
        return (nums.length * (nums.length+1)/2) - sum;
    }
}
__________________________________________________________________________________________________