03 2019 档案
摘要:var a; // var a=100;//第一行为100 function yubianyi(a){ document.write(a,'<br>');//underfine a=100; document.write(a,'<br>');//100 var a=10; document.writ
阅读全文
摘要:https://blog.csdn.net/zhou120189162/article/details/78454740 https://blog.csdn.net/u010802169/article/details/80490886 详情请查看官网https://git-scm.com/book
阅读全文
摘要:1.判断n是否只能被1和自己整除。 var num=function(n) { if (n <= 3) { return n > 1; } if (n % 2 == 0 || n % 3 == 0) { return false; } for(var i = 5; i * i <= n; i +=
阅读全文