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

{"id":576435,"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 findGCD(a, b) {\\n  if (b === 0) {\\n    return a;\\n  }\\n  console.log(`${a} % ${b} = ${a % b}`);\\n  return findGCD(b, a % b);\\n}\\n\\nconst num1 = 48;\\nconst num2 = 18;\\n\\nconsole.log(`Finding the GCD of ${num1} and ${num2}`);\\nconst gcd = findGCD(num1, num2);\\nconsole.log(`The greatest common divisor is: ${gcd}`);\\n\"}","created_at":"2023-07-28T11:29:09.630+08:00","updated_at":"2023-07-31T14:52:12.691+08:00","name":"【綜合練習】遞迴與河內塔：實作 2 - 解答","language":"web","screenshot":{"url":null},"parent_id":576434,"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 findGCD(a, b) {\n  if (b === 0) { // 若 b 為 0，則 a 即為最大公因數\n    return a;\n  }\n  console.log(\\`\\${a} % \\${b} = \\${a % b}\\`); // 輸出 a 除以 b 的餘數\n  return findGCD(b, a % b); // 遞迴呼叫函式，將 b 與 a 除以 b 的餘數作為新的參數\n}\n\nconst num1 = 48;\nconst num2 = 18;\n\nconsole.log(\\`Finding the GCD of \\${num1} and \\${num2}\\`);\nconst gcd = findGCD(num1, num2); // 呼叫尋找最大公因數的函式\nconsole.log(\\`The greatest common divisor is: \\${gcd}\\`); // 輸出最大公因數\n\u003c/pre\u003e`\n","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":31,"hashid":"4y3szj9zr","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}