ChienI Kao 筆記網站 JHTNT 筆記網站 # What is AI? 能夠如同人類進行智慧處理的技術、機器 # 人工智能認知狀態 強人工智慧: 可能擁有人類的自我意識，具有超越人類的可能性 弱人工智慧: 可能會取代部分的人類能力，但沒辦法取代全部 # 人工智慧發展階段 機器學習: 進行適當的處理，就可以根據輸入資料預測數值、最佳化。 深度學習: 輸入資料不經過處理，讓電腦自己擷取特徵，來獲取最後的結果。 # 機器學習 Machine Learning 讓電腦有更高的辨識程度，需要決定要依據哪個基準 (參數) 運作。 機器學習能夠根據輸入資料，自動決定 (學習)...

⭐️ # 題目敘述 You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second half. Two strings are alike if they have the same number of vowels ( 'a' , 'e' , 'i' , 'o' , 'u' ,...

ChienI Kao 筆記網站 JHTNT 筆記網站 # 前言 這是一份關於計畫的紀錄，由我的指導教授與學長提供的資料開始進行研究，主要是要撰寫一個基於深度學習與強化學習麻將對局的程式，希望可以寫出一個臺灣麻將與日本麻將。 # 參考論文 應用深度學習與強化學習於臺灣麻將對局程式之研究 Research on Applying Deepp Learning and Reinforcement Learning to Taiwanese Mahjong Program 指導教授：黃國展 撰寫者：陳昕斈 #...

⭐️⭐️⭐️ # 題目敘述 Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b . A node a is an ancestor of b if either: any child of a is equal to b or any child of a is an ancestor of b . # Example 1 Input:...

⭐️⭐️⭐️ # 題目敘述 Alice has n balloons arranged on a rope. You are given a 0-indexed string colors where colors[i] is the color of the ith balloon. Alice wants the rope to be colorful. She does not want two consecutive balloons to be of the same color, so she asks Bob for help. Bob can remove some...

⭐️ # 題目敘述 You are given a string s consisting only of the characters '0' and '1' . In one operation, you can change any '0' to '1' or vice versa. The string is called alternating if no two adjacent characters are equal. For example, the string "010"...

⭐️ # 題目敘述 You are given an integer array prices representing the prices of various chocolates in a store. You are also given a single integer money , which represents your initial amount of money. You must buy exactly two chocolates in such a way that you still have some non-negative leftover money....

ChienI Kao 筆記網站 JHTNT 筆記網站 # 題目 Floyd-Warshall 演算法 wiki 撰寫出 Floyd-Warshall 演算法，處理點到點的最短路徑 # 單機版程式 #include <bits/stdc++.h>#define N 1000using namespace std;int main() { srand(36); long start = clock(); int **D; D = (int **)malloc(N * sizeof(int *)); for (int i = 0; i <...

⭐️ # 題目敘述 The product difference between two pairs (a, b) and (c, d) is defined as (a * b) - (c * d) . For example, the product difference between (5, 6) and (2, 7) is (5 * 6) - (2 * 7) = 16 . Given an integer array nums , choose four distinct indices w , x , y , and z such that the product...

⭐️⭐️⭐️ # 題目敘述 Design a food rating system that can do the following: Modify the rating of a food item listed in the system. Return the highest-rated food item for a type of cuisine in the system. Implement the FoodRatings class: FoodRatings(String[] foods, String[] cuisines, int[] ratings)...