【綜合練習】破解金庫密碼：實作 1 - 解答 | 程式專案

{"id":576373,"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 binarySearch(target, array) {\\n  let left = 0;\\n  let right = array.length - 1;\\n  while (left \u003c= right) {\\n    let mid = Math.floor((left + right) / 2);\\n    if (array[mid] === target) {\\n      return mid;\\n    }\\n    if (array[mid] \u003c target) {\\n      left = mid + 1;\\n    } else {\\n      right = mid - 1;\\n    }\\n  }\\n  return -1;\\n}\\n\\nconst target = 7;\\nconst inputArray = [1, 2, 3, 4, 5, 6, 7, 8, 9];\\nconst result = binarySearch(target, inputArray);\\nconsole.log(`目標值 ${target} 在索引 ${result} 的位置`);\"}","created_at":"2023-07-28T11:05:40.740+08:00","updated_at":"2023-07-31T12:45:34.656+08:00","name":"【綜合練習】破解金庫密碼：實作 1 - 解答","language":"web","screenshot":{"url":null},"parent_id":576371,"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 binarySearch(target, array) {\n  let left = 0; // 左邊界索引\n  let right = array.length - 1; // 右邊界索引\n  while (left \u003c= right) { // 當左邊界小於等於右邊界時繼續搜尋\n    let mid = Math.floor((left + right) / 2); // 取得中間索引\n    if (array[mid] === target) { // 如果中間元素等於目標值，則找到目標值\n      return mid; // 回傳目標值的索引\n    }\n    if (array[mid] \u003c target) { // 如果中間元素小於目標值，則目標值在右半部分\n      left = mid + 1; // 更新左邊界索引為中間索引加一\n    } else { // 如果中間元素大於目標值，則目標值在左半部分\n      right = mid - 1; // 更新右邊界索引為中間索引減一\n    }\n  }\n  return -1; // 搜尋結束後仍未找到目標值，回傳 -1 表示未找到\n}\n\nconst target = 7; // 目標值\nconst inputArray = [1, 2, 3, 4, 5, 6, 7, 8, 9]; // 輸入陣列（已排序）\nconst result = binarySearch(target, inputArray); // 呼叫二分搜尋函式\nconsole.log(\\`目標值 \\${target} 在索引 \\${result} 的位置\\`);\n\u003c/pre\u003e`\n","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":30,"hashid":"gk4sp686m","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}