【綜合練習】遞迴與河內塔：實作 1 - 解答 | 程式專案

{"id":576432,"student_id":2589,"content":"{\"html\":\"\u003c!DOCTYPE html\u003e\\n\u003chtml\u003e\\n\u003chead\u003e\\n\\t\u003ctitle\u003eDocument\u003c/title\u003e\\n\u003c/head\u003e\\n\u003cbody\u003e\\n    \u003cdiv id=\\\"question\\\"\u003e\\n        \u003cp\u003e請依照以下步驟進行綜合練習：\u003c/p\u003e\\n        \u003cp\u003e1. 搭配過去學過的演算法知識（用迴圈尋找最大公因數），來閱讀練習頁面中的 JavaScript。\u003c/p\u003e\\n        \u003cp\u003e2. 修改練習頁面中的 JavaScript，讓執行後網頁上的顯示文字與下方相同。\u003c/p\u003e\\n    \u003c/div\u003e\\n    \u003cdiv id=\\\"screenshot\\\"\u003e\\n        \u003cp\u003e題目：\u003c/p\u003e\\n        \u003cdiv id=\\\"log\\\"\u003eloading...\u003c/div\u003e\\n    \u003c/div\u003e\\n    \u003cdiv id=\\\"screenshot\\\"\u003e\\n        \u003cp\u003e解答：\u003c/p\u003e\\n        \u003cdiv id=\\\"code\\\"\u003eloading...\u003c/div\u003e\\n    \u003c/div\u003e\\n\u003c/body\u003e\\n\u003c/html\u003e\",\"css\":\"* {\\n    margin: 0;\\n    padding: 0;\\n    box-sizing: border-box;\\n    font-size: 16px;\\n}\\n\\nhtml, body {\\n    width: 100%;\\n    height: 100%;\\n    background-color: #333;\\n    padding: 10px;\\n}\\n\\np {\\n    color: white;\\n    margin-bottom: 10px;\\n}\\n\\n#log {\\n    color: #03F501;\\n    padding: 10px;\\n    border: 1px solid white;\\n    border-radius: 5px;\\n}\\n\\n#code {\\n    color: #03F501;\\n    padding: 10px;\\n    border: 1px solid white;\\n    border-radius: 5px;\\n    overflow-x: scroll;\\n}\\n\\n#question {\\n    height: 130px;\\n    border: 1px solid white;\\n    padding: 20px;\\n    margin-bottom: 10px;\\n}\\n\\n#screenshot {\\n    border: 1px solid white;\\n    padding: 20px;\\n    margin-bottom: 10px;\\n}\",\"js\":\"function findGreatestCommonDivisor(a, b) {\\n  let divisor = 2;\\n  let greatestCommonDivisor = 1;\\n\\n  while (a \u003e= divisor \u0026\u0026 b \u003e= divisor) {\\n    if (a % divisor === 0 \u0026\u0026 b % divisor === 0) {\\n      greatestCommonDivisor = divisor;\\n    }\\n    divisor++;\\n  }\\n  return greatestCommonDivisor;\\n}\\n\\nconst num1 = 24;\\nconst num2 = 36;\\nconst gcd = findGreatestCommonDivisor(num1, num2);\\n\\nconsole.log(`The greatest common divisor of ${num1} and ${num2} is ${gcd}`);\\n\"}","created_at":"2023-07-28T11:28:25.490+08:00","updated_at":"2023-07-31T14:45:29.463+08:00","name":"【綜合練習】遞迴與河內塔：實作 1 - 解答","language":"web","screenshot":{"url":null},"parent_id":576431,"plugin":"(function () {\n    if (!console) {\n        console = {};\n    }\n    var old = console.log;\n    var logger = document.getElementById('log');\n    logger.innerHTML = \"\"\n    console.log = function (message) {\n        if (typeof message == 'object') {\n            logger.innerHTML += (JSON \u0026\u0026 JSON.stringify ? JSON.stringify(message) : String(message)) + '\u003cbr /\u003e';\n        } else {\n            logger.innerHTML += message + '\u003cbr /\u003e';\n        }\n    }\n})();\n\ndocument.querySelector(\"#code\").innerHTML = `\u003cpre\u003e// 使用迴圈尋找最大公因數的函式\nfunction findGreatestCommonDivisor(a, b) {\n  let divisor = 2; // 從最小的除數 2 開始檢查\n  let greatestCommonDivisor = 1; // 初始化最大公因數為 1\n\n  while (a \u003e= divisor \u0026\u0026 b \u003e= divisor) { // 當 a 和 b 都大於等於除數時繼續檢查\n    if (a % divisor === 0 \u0026\u0026 b % divisor === 0) { // 如果 a 和 b 都能被除數整除\n      greatestCommonDivisor = divisor; // 更新最大公因數\n    }\n    divisor++; // 檢查下一個除數\n  }\n  return greatestCommonDivisor; // 回傳最大公因數\n}\n\nconst num1 = 24;\nconst num2 = 36;\nconst gcd = findGreatestCommonDivisor(num1, num2);\n\nconsole.log(\\`數字 \\${num1} 和 \\${num2} 的最大公因數是 \\${gcd}\\`);\n\u003c/pre\u003e`\n","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":37,"hashid":"gk4sp65pn","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}