| https://leetcode.com/problems/missing-number | Easy |
|---|
class Solution {
fun missingNumber(nums: IntArray): Int {
val n = nums.size
var sum = 0
var i = 0
while (i < n) {
sum += nums[i]
i++
}
val total = n * (n + 1) / 2
return total - sum
}
}