m-dididid的博客

判断一个整数是否为素数 思路：让该数整除所有小于等于本身的所有整数，并定义一个数值记录有几个结果为0，若该数为素数，则结果一定为2，否则不算素数 var isPrime = function (num, count = 0) { //一个一个整除小于它本身的数 for (let i = 0; i <= num; i++) { if (num % i == 0) { count++; }

罗马数字转换器 function convertToRoman(num) { var decimal=[1000,900,500,400,100,90,50,40,10,9,5,4,1]; var romanNumeral=["M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"]; //与上面一一对应 var result=""; // 循环 for(let i=0;i<decimal.length