{"id":694856,"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\":\"// 二分搜尋演算法\\r\\nfunction binarySearch(array, target) {\\r\\n let left = 0; // 左邊界索引\\r\\n let right = array.length - 1; // 右邊界索引\\r\\n while (left \u003c= right) { // 當左邊界小於等於右邊界時繼續搜尋\\r\\n const mid = Math.floor((left + right) / 2); // 取得中間索引\\r\\n if (array[mid] === target) { // 若中間元素等於目標值,表示找到目標值\\r\\n return true;\\r\\n } else if (array[mid] \u003c target) { // 若中間元素小於目標值,則目標值可能在右半部分\\r\\n left = mid + 1; // 更新左邊界索引為中間索引加一\\r\\n } else { // 若中間元素大於目標值,則目標值可能在左半部分\\r\\n right = mid - 1; // 更新右邊界索引為中間索引減一\\r\\n }\\r\\n }\\r\\n return false; // 搜尋結束後仍未找到目標值,返回 false\\r\\n}\\r\\n\\r\\n// 定義一個已排序的數字陣列\\r\\nconst array = [2, 4, 6, 8, 10, 12, 14, 16, 18, 20];\\r\\nconst target = 10; // 目標值\\r\\nconst isFound = binarySearch(array, target); // 呼叫二分搜尋函式搜尋目標值\\r\\n\\r\\nif (isFound) { // 若目標值存在於陣列中\\r\\n console.log(`Target ${target} found in the array`); // 輸出訊息表示找到目標值\\r\\n} else { // 若目標值不存在於陣列中\\r\\n console.log(`Target ${target} not found in the array`); // 輸出訊息表示未找到目標值\\r\\n}\"}","created_at":"2024-02-14T17:13:30.848+08:00","updated_at":"2024-02-14T17:14:22.193+08:00","name":"【綜合練習】五子棋 AI:實作 3 - 問題 副本","language":"web","screenshot":{"url":"https://cdn7.koding.school/uploads/project/screenshot/694856/754351adeb7524e78bddd1f737120b81.jpg"},"parent_id":576487,"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","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":48,"hashid":"5j3sjpnd4","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}
[{"id":15565251,"file_name":"koding.png","project_id":694856,"asset_id":665047,"created_at":"2024-02-14T17:13:30.854+08:00","updated_at":"2024-02-14T17:13:30.854+08:00"}]
橘蘋學習平台
我的作品
檢視專案頁
匯出
複製
匯入
刪除
下載 Android APP (APK)
截圖
前往網站頁面
繁中
简中
English
日本語
1:1:1
1:1
全寬
用手機掃描下方 QRCode 進行安裝
或您也可以
下載 APK
到這台電腦
用手機掃描下方 QRCode 進行安裝
或您也可以
下載 APK
到這台電腦