摘要:
What is the GCD? In mathematics, the greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest posi 阅读全文
摘要:
The division (/) operator produces the quotient of its operands where the left operand is the dividend and the right operand is the divisor. The divis 阅读全文
摘要:
find out diagonal for(let b = 1; b <= 9; ++b) { let res = '' for(let p = 1; p <= 9; ++p) { if(b > p) res += ' ' else res += '*' } console.log(res) } f 阅读全文
摘要:
XMLHttpRequest (javascript.info) <body> <script> // Create a new XMLHTTPRequest object let xhr = new XMLHttpRequest() xhr.timeout = 5000 // timeout in 阅读全文
摘要:
1. push.default https://www.fleekitsolutions.com/difference-between-push-default-matching-simple/ Set your push.default to upstream to push branches t 阅读全文