【綜合練習】排程演算法：實作 1 - 題目說明 | 程式專案

{"id":576363,"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\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 cyclicScheduling(tasks, numWorkers) {\\n    const schedule = [];\\n    const workerTasks = new Array(numWorkers).fill([]);\\n    for (let i = 0; i \u003c tasks.length; i++) {\\n        const task = tasks[i];\\n        const workerIndex = i % numWorkers;\\n        workerTasks[workerIndex].push(task);\\n    }\\n    for (let i = 0; i \u003c numWorkers; i++) {\\n        schedule.push(workerTasks[i]);\\n    }\\n    return schedule;\\n}\\nconst tasks = ['Task 1', 'Task 2', 'Task 3', 'Task 4', 'Task 5', 'Task 6'];\\nconst numWorkers = 3;\\nconst schedule = cyclicScheduling(tasks, numWorkers);\\nconsole.log('循環排程結果：');\\nfor (let i = 0; i \u003c schedule.length; i++) {\\n    console.log(`Worker ${i + 1}: ${schedule[i].join(', ')}`);\\n}\"}","created_at":"2023-07-28T11:01:47.566+08:00","updated_at":"2023-07-31T12:20:38.618+08:00","name":"【綜合練習】排程演算法：實作 1 - 題目說明","language":"web","screenshot":{"url":null},"parent_id":576361,"plugin":"(function () {\n    if (!console) {\n        console = {};\n    }\n    var old = console.log;\n    var logger = document.getElementById('log');\n    console.log = function (message) {\n        logger.innerHTML = \"\"\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","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":33,"hashid":"36ysd6jvq","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}