實踐大學影音平台
×
登入
媒體中心
實踐大學 - FMS影音平台
首頁
>
媒體中心
>
資訊科技
>
物件導向Java
>
EverCam
Count Trees Part-2
13:05,
502
views
,
2021-05-14,
上傳者: 系統管理者,
收藏
0
<< Prev
Next >>
auto next
播放設定
寫筆記
索引
1. Count the Trees Problem
2. Sample Input and Sample Output
3. Coding of Count Trees Part 1
物件導向Java
1. 第1講 讀取類別 (Scanner)
1.1
讀取類別：Scanner-簡介
1.2
讀取類別：Scanner-自訂斷字規則
1.3
斷字符號-useDelimiter
1.4
數閏年(February 29)
1.5
讀取類別：Scanner-不定數量解譯
1.6
Simply Subsets - Part 1 (讀不定數量整數)
1.7
Simply Subsets - Part 2 (陣列清單包不包含)
2. 第2講 建構方法(Constructor)
2.1
建構方法-Condtructor-1
2.2
建構方法-Constructor-2
2.3
合併-尋找(UnionFind)的應用
2.4
合併-尋找(UnionFind)的資料結構
2.5
合併-尋找(UnionFind)的節能設計
2.6
UnionFind-Scanner (Part 1)
2.7
UnionFind-Constructor (Part 2)
2.8
Union-Find-Methods (Part 3)
2.9
UnionFind-Compress (Part 4)
3. 第3講 封裝(Encapsulation)
3.1
封裝(Encapsulation)：Sudoku-1
3.2
位元遮罩(Bit-Mask)：Sudoku-2
3.3
深度優先搜尋(Depth-First Search): Sudoku-3
3.4
Sudoku-Scanner (Part 1)
3.5
Sudoku-Setup BitMask (Part 2)
3.6
Sudoku-Dump BitMask (Part 3)
3.7
Sudoku-Depth-First-Search (Part 4)
4. 第4講 覆寫(Overriding)
4.1
覆寫(Overriding)-CompoundWords-1
4.2
覆寫(Overriding)-CompoundWords-2
4.3
覆寫(Overriding)-CompoundWords-3
4.4
CompoundWords-ArrayList (Part 1)
4.5
CompoundWords-Overriding (Part 2)
5. 第5講 例外(Exception)
5.1
例外(Exception)-簡介
5.2
溢位(Overflow)
5.3
客製化例外(extends Exception)
5.4
溢位例外(MyOverflowException)-Coding Part 1
5.5
溢位例外(MyOverflowException)-Coding Part 2
5.6
溢位例外(MyOverflowException)-Coding Part 3
5.7
溢位例外(OverflowException)-Coding Part 1
5.8
溢位例外(OverflowException)-Coding Part 2
5.9
溢位例外(OverflowException)-Coding Part 3
5.10
溢位例外(OverflowException)-Coding Part 4
5.11
溢位例外(OverflowException)-Coding Part 5
6. 第6講 泛型
6.1
Generic Types-Introduction
6.2
Priority Queue-Heap-1
6.3
Priority Queue-Heap-2
7. 第7講 堆疊類別(Stack)
7.1
堆疊類別(Stack)-1
7.2
後置式(Postfix)
7.3
堆疊類別(Stack)-Infix2Postfix
7.4
Equation-tokenized Coding Part 1
7.5
Equation-Precedence Coding Part 2
7.6
Equation Coding Part 3
7.7
Expression-Tokenized Coding Part 1
7.8
Expression-Infix2Postfix Coding Part 2
7.9
Expression-Evaluate Postfix Coding Part 3
8. 第8講 陣列類別 (ArrayList)
8.1
Topological Sort Part-1
8.2
Topological Sort Part-2
8.3
Topological Sort Part-3
9. 第9章 鏈類別 (LinkedList)
9.1
LinkedList Part-1
9.2
LinkedList Part-2
9.3
LinkedList Part-3
9.4
LinkedList Part-4
9.5
LinkedList Part-5
9.6
LinkedList Part-6
10. 第10講 佇列與優先佇列類別 (Queue & PriorityQueue)
10.1
Guess Data Structure Part-1
10.2
Guess Data Structure Part-2
10.3
Guess Data Structure Part-3
10.4
Guess Data Structure Part-4
11. 第11講 集類別 (Collections)
11.1
Collections Part-1
11.2
Collections Part-2
11.3
Collections Part-3
11.4
Collections Part-4
11.5
Frequencies Part-1
11.6
Frequencies Part-2
11.7
Frequencies Part-3
12. 第12講 大數類別 (BigInteger)
12.1
Count Trees Part-1
12.2
Count Trees Part-2
12.3
Count Trees Part-3
13. 第13講 整數類別 (Integer)
13.1
Funny Encryption Part-1
13.2
Funny Encryption Part-2
14. 第14講 雜湊對應類別 (HashMap)
14.1
HashMap Part-1
14.2
HashMap Part-2
14.3
HashMap Part-3
14.4
HashMap Part-4
14.5
HashMap Part-5
14.6
Lock Manager Part-1
14.7
Lock Manager Part-2
14.8
Lock Manager Part-3
14.9
Lock Manager Part-4
14.10
Lock Manager Part-5
14.11
Lock Manager Part-6
15. 範例1 - 最大公因數
15.1
GCD Part-1
15.2
GCD Part-2
15.3
GCD Part-3
16. 範例2 - 共同排列
16.1
Common Permutation Part-1
16.2
Common Permutation Part-2
17. 範例3 - 接龍
17.1
Blocks Part-1
17.2
Blocks Part-2
17.3
Blocks Part-3
17.4
Blocks Part-4
17.5
Blocks Part-5
17.6
Blocks Part-6
17.7
Blocks Part-7
Prev
Count Trees Part-1
Next
Count Trees Part-3
簡介
回應
分享
詳細
訪客如要回應，請先
登入
資料夾 :
物件導向Java
發表時間 :
2021-05-14 05:25:08
觀看數 :
502
長度 :
13:05
發表人 :
系統管理者
部門 :
www
QR Code :
Prev
Count Trees Part-1
Count Trees Part-3
Count Trees Part-3