【綜合練習】五子棋 AI：實作 2 - 解答 | 程式專案

{"id":576483,"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 binarySearchRecursive(array, target, left, right) {\\n  if (left \u003e right) {\\n    return -1;\\n  }\\n  const mid = Math.floor((left + right) / 2);\\n  if (array[mid] === target) {\\n    return mid;\\n  } else if (array[mid] \u003c target) {\\n    return binarySearchRecursive(array, target, mid + 1, right);\\n  } else {\\n    return binarySearchRecursive(array, target, left, mid - 1);\\n  }\\n}\\n\\nfunction binarySearch(array, target) {\\n  return binarySearchRecursive(array, target, 0, array.length - 1);\\n}\\n\\nconst array = [2, 4, 6, 8, 10, 12, 14, 16, 18, 20];\\nconst target = 10;\\nconst index = binarySearch(array, target);\\n\\nif (index !== -1) {\\n  console.log(`Target ${target} found at index ${index}`);\\n} else {\\n  console.log(`Target ${target} not found in the array`);\\n}\"}","created_at":"2023-07-28T11:43:58.725+08:00","updated_at":"2023-07-31T17:39:02.874+08:00","name":"【綜合練習】五子棋 AI：實作 2 - 解答","language":"web","screenshot":{"url":null},"parent_id":576482,"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 binarySearchRecursive(array, target, left, right) {\n  if (left \u003e right) { // 若左指標大於右指標，表示目標不存在於陣列中\n    return -1;\n  }\n  const mid = Math.floor((left + right) / 2); // 計算中間索引\n  if (array[mid] === target) { // 若中間元素等於目標，則找到目標，返回索引\n    return mid;\n  } else if (array[mid] \u003c target) { // 若中間元素小於目標，則目標可能在右半部分，遞迴搜尋右半部分\n    return binarySearchRecursive(array, target, mid + 1, right);\n  } else { // 若中間元素大於目標，則目標可能在左半部分，遞迴搜尋左半部分\n    return binarySearchRecursive(array, target, left, mid - 1);\n  }\n}\n\n// 使用二分搜尋算法尋找目標元素在陣列中的索引\nfunction binarySearch(array, target) {\n  return binarySearchRecursive(array, target, 0, array.length - 1);\n}\n\nconst array = [2, 4, 6, 8, 10, 12, 14, 16, 18, 20];\nconst target = 10;\nconst index = binarySearch(array, target);\n\nif (index !== -1) {\n  console.log(\\`Target \\${target} found at index \\${index}\\`);\n} else {\n  console.log(\\`Target \\${target} not found in the array\\`);\n}\n\u003c/pre\u003e`\n","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":32,"hashid":"npmszmew6","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}