day1寻找除数

题目：

Create a function named divisors/Divisors that takes an integer n > 1 and returns an array with all of the integer's divisors(except for 1 and the number itself), from smallest to largest. If the number is prime return the string '(integer) is prime' (null in C#, empty table in COBOL) (use Either String a in Haskell and Result<Vec<u32>, String> in Rust).

Examples:
divisors(12) --> [2, 3, 4, 6]
divisors(25) --> [5]
divisors(13) --> "13 is prime"

我的答案：

function divisors(integer) {
let arr=[];
for(var i=1;i++;i<integer){
if(integer%i===0)arr.push(i)
}
return arr;
}

正确答案：

function divisors(integer) {
var res = []
for (var i = 2; i <= Math.floor(integer / 2); ++i) if (integer % i == 0) res.push(i);
return res.length ? res : integer + ' is prime'
};或者

function divisors(integer) {
var divs = [];

for(var i = 2; i < integer; i++) {
if(integer % i === 0) {
divs.push(i);
}
}

return divs.length ? divs : integer + ' is prime';
};