【綜合練習】遞迴與河內塔：實作 3 - 問題副本 | 程式專案

{"id":711479,"student_id":1443,"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=\\\"screenshot\\\"\u003e\\n        \u003cp\u003e題目：\u003c/p\u003e\\n        \u003cdiv id=\\\"log\\\"\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\":\"//  -- 說明 --  //\\n//  請想想看要如何組合和調整程式碼，\\n//  執行後才能讓網頁上的顯示文字與下方相同。\\n\\n//  -- 提示 --  //\\n//  if (n === 0) return [];\\n//  if (n === 1) return [0];\\n//  if (n === 2) return [0, 1];\\n//  for (let i = 2; i \u003c n; i++) {}\\n//  const nextValue = sequence[i - 1] + sequence[i - 2];\\n//  sequence.push(nextValue);\\n// 使用迴圈計算費氏數列的函式\\nfunction fibonacciSequence(n) {\\n  if (n === 0) return []; // 若 n 為 0，返回空數列\\n  if (n === 1) return [0]; // 若 n 為 1，返回只含有 0 的數列\\n  if (n === 2) return [0, 1]; // 若 n 為 2，返回含有 0 和 1 的數列\\n  const sequence = [0, 1]; // 初始化數列，前兩個數字為 0 和 1\\n  for (let i = 2; i \u003c n; i++) { // 從第三個數字開始計算\\n    const nextValue = sequence[i - 1] + sequence[i - 2]; // 計算下一個數字\\n    sequence.push(nextValue); // 將下一個數字加入數列\\n  }\\n  return sequence; // 返回完整的費波那契數列\\n}\\n\\nconst n = 10; // 設定要生成費波那契數列的長度\\nconst sequence = fibonacciSequence(n); // 呼叫費波那契數列函式\\n\\nconsole.log(`Fibonacci sequence of length ${n}:`); // 輸出費波那契數列的長度\\nconsole.log(sequence.join(', ')); // 輸出費波那契數列的內容，以逗號分隔\"}","created_at":"2024-03-11T15:42:14.390+08:00","updated_at":"2024-03-11T15:42:35.440+08:00","name":"【綜合練習】遞迴與河內塔：實作 3 - 問題 副本","language":"web","screenshot":{"url":"https://cdn6.koding.school/uploads/project/screenshot/711479/2cb3dfd8d143d5d20341979f9a58834d.jpg"},"parent_id":576437,"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})();","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":92,"hashid":"5j3sjdyrg","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}