函数封装练习

function isPrime(n) {
if (isNaN(n)) return false;
n = Number(n);
for (var i = 2; i <= n / 2; i++) {
if (n % i === 0) break;
}
return i > n / 2;
}

// 求当年的第几天
function isDate(year, mouth, date) {
var num = date;
switch (mouth) {
case 12:
num += 30;
case 11:
num += 31;
case 10:
num += 31;
case 9:
num += 30;
case 8:
num += 31;
case 7:
num += 30;
case 6:
num += 31;
case 5:
num += 30;
case 4:
num += 31;
case 3:
num += (year % 4 === 0 && year % 100 !== 0) || year % 400 === 0 ? 29 : 28;
case 2:
num += 31;
}
console.log(‘是’ + year + ‘的第’ + num + ‘天’);
}

// 求最大公约数
function Divisor(a, b) {
var min = a,
max = b;
if (a > b) {
max = a;
min = b;
}
var num = 0;
while (max % min !== 0) {
num = max % min;
max = min;
min = num;
}
console.log(min + ‘是最大公约数’);
}

// 求最小公倍数
function multiple(a, b) {
var max = a,
min = b;
if (a < b) {
max = b;
min = a;
}
for (var i = max; i <= min * max; i += max) {
if (i % min === 0) {
console.log(min + ‘和’ + max + ‘最小公倍数是’ + i);
break;
}
}
}