3.9k 4 分鐘

ChienI Kao 筆記網站 JHTNT 筆記網站 資料庫串接檔案配置 檔案路徑: ruoyi-admin/src/main/resources/application.yml ruoyi-admin/src/main/resources/application-druid.yml # 資料庫搜尋 開始撰寫前,記得檢查資料庫配置文件是否修改正確! # 信息操作處理 檔案路徑: ruoyi-admin/src/main/java/com.ruoyi/web/controller/system 創建檔案:...
151 1 分鐘

ChienI Kao 筆記網站 JHTNT 筆記網站 利用若依管理系統程式內容進行延伸撰寫,可以先 clone 若依管理系統的程式,方便跟上後面描述 (待附上連接) IDE: intellij API 測試工具: Postman (與 swagger 差異待比較) SQL Sever: MySQL/Xampp phpmyadmin # 檔案結構
908 1 分鐘

⭐️ # 題目敘述 Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Note: A leaf is a node with no children. # Example 1 Input: root = [3,9,20,null,null,15,7] Output: 2 # Example 2 Input: root =...
2.2k 2 分鐘

⭐️⭐️⭐️ # 題目敘述 A teacher is writing a test with n true/false questions, with 'T' denoting true and 'F' denoting false. He wants to confuse the students by maximizing the number of consecutive questions with the same answer (multiple trues or multiple falses in a row). You are given a...
889 1 分鐘

⭐️⭐️⭐️ # 題目敘述 Given a binary array nums , you should delete one element from it. Return the size of the longest non-empty subarray containing only 1 's in the resulting array. Return 0 if there is no such subarray. # Example 1 Input: nums = [1,1,0,1] Output: 3 Explanation: After deleting the...
6k 5 分鐘

# 2023.07.02 (日) 行程 8:00 ~ 10:00 立榮航空飛機 台北松山 (TSA) - 上海浦東 (PVG) 12:00 ~ 13:00 前往如家酒店.neo (上海火車站店)/ 午餐 14:00 ~ 16:00 辦理電話卡 16:00 ~ 19:00 吃晚餐 # 紀錄 日記 第一天抵達上海,沒想到天氣還蠻熱的,今天還沒開始實習,下午由上海市科協的老師帶我們去申辦電話卡,因為我們人蠻多的,所以了一些時間,不過其實整個辦理的流程很快,接下來就是吃完餐了,但因為今天一大早就搭飛機,5:00...
877 1 分鐘

⭐️⭐️⭐️ # 題目敘述 Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it. You must implement a solution with a linear runtime complexity and use only constant extra space. # Example 1 Input: nums =...
1.5k 1 分鐘

⭐️ # 題目敘述 Given two strings s and goal , return true if you can swap two letters in s so the result is equal to goal , otherwise, return false . Swapping letters is defined as taking two indices i and j (0-indexed) such that i != j and swapping the characters at s[i] and s[j] . For example,...
1.3k 1 分鐘

ChienI Kao 筆記網站 JHTNT 筆記網站 # Text Interpolation Using the "Mustache" syntax (double curly braces 兩個大括號 {{ }} ) <p> {{ value }} </p>But Mustaches cannot be used inside HTML attributes. #...
4.4k 4 分鐘

ChienI Kao 筆記網站 JHTNT 筆記網站 # 專案結構 tree /f > structure.txt有整理過的 structure.txtvue-project│ .gitignore│ env.d.ts│ index.html│ output.txt│ package-lock.json│ package.json│ README.md│ tsconfig.app.json│ tsconfig.json│ tsconfig.node.json│ vite.config.ts│ ├─.vscode│ extensions.json│ ├─public│...