Intuitive Java solution


  • 0
    S

    Not very short, but quite intuitive to satisfy the requirments.

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

    }


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.