codewars算法题-求因子

算法要求

Create a function named divisors that takes an integer and returns an array with all of the integer’s divisors(except for 1 and the number itself). If the number is prime return the string ‘(integer) is prime’ (use Either String a in Haskell).
创建一个divisors函数，参数为一个整数，返回该整数的除数（除了1和她本身），如果该整数是质数的话，返回返回一段字符串”(integer) is prime’”

function divisors(integer) {
  var i=2;
  var arr = [];
  for( ; i <= integer/2 ; i++){
    if(integer%i == 0 ){
      arr.push(i);
    }
  }
  if(arr.length == 0){
    return integer+" is prime";
  }else {
    return arr;
  }
};

当作记录，不定期更新