JS absolute minimum value of the sum of Huawei od two numbers

title ： The absolute value of the sum of the two numbers is the smallest  | The time limit ：1 second  | Memory limit ：32768K | Language restrictions ： There is no limit

Given an ordered sequence of integers from small to large （ There are positive and negative integers ） Array nums , Please find two numbers in the array , The absolute value of its sum (|nums[x]+nums[y]|) Is the minimum , And return this absolute value .
Each input will only correspond to one answer . however , The same element in an array cannot be used twice .

Input description :

Output description :

The absolute minimum of the sum of two numbers

---

Example 1

Input ：

-3 -1 5 7 11 15

Output ：

2

explain ：

because |nums[0] + nums[2]| = |-3 + 5| = 2 Minimum , So back 2

let nums = readline().split(" ").map(Number);
let n = nums.length;
let min = Infinity
for(let i=0;i<n-1;i++){
    for(let j=i+1;j<n;j++){
        let count = Math.abs(nums[i] + nums[j]);   
        min = Math.min(count, min);
    }
}
console.log(min);