/*给任意一个偶数,找出他的所有的质数因子*/ function primeFactor(n){ var factors=[], divistor=2; if(typeof n !=='number'||!Number.isInteger(n)){ return 0; }; //如果不是偶数返回0,如果是0,返回0
偶数求和 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26480 Accepted Submission(s): 11486 Problem Description 有一个长度为n(n<=100)的数列,该数列定义为从2开