leetcode-note
Introduction
how-to-come-up-with-algorithm
知識
Hash Table
Java Class & Interface
Java knowledge scope
Memory (Heap v.s. Stack)
Singleton 設計模式
Recursive, Recursion, Recurrence
Java - Garbage collection
Java Inheritance
Java Unit testing
Java - Why StringBuilder is faster than String
Java Priority Queue Comparator
Merge Sort Implementation
Iterate Map
工具
Interview SOP
Array
# 1
# 15
# 26
# 33
# 48
# 54
# 56
# 57
# 75
# 84
# 88
# 122
# 153
# 243
# 277
# 287
# 311
# 419
# 731
Backtracking
# 17
# 22
# 46
# 79
# 211
# 212
# 291
# 399
# 425
# 22
Binary Tree
# 100
# 101
# 102
# 103
# 104
# 106
# 107
# 110
# 111
# 145
# 236
# 257
# 270
# 285
# 297
# 333
# 404
Binary Indexed Tree
# 307
# 308
# 315
Binary Search
# 4
# 33
# 50
# 74
# 153
# 349
# 378
# 719
# 878
Bit Manipulation
# 191
# 338
# 371
Depth-First Search
# 200
# 282
# 301
# 329
# 394
# 472
# 679
# 778
Design
# 146
# 170
# 173
# 208
# 232
# 251
# 281
# 284
# 295
# 297
# 341
# 362
# 379
# 352
# 706
Divide and Conquer
# 241
Dynamic Programming
#10
# 53
# 62
# 72
# 85
# 91
# 121
# 123
# 139
# 174
# 276
# 279
# 309
# 312
# 357
# 375
# 418
# 471
# 474
# 486
Hash Table
# 325
Heap
# 218
# 215
# 703
Graph
# 269
# 207
Greedy
# 134
# 321
Linked List
# 206
# 138
# 141
# 445
# 273
# 237
# 21
# 2
# 24
# 160
# 25
# 23
Math
# 204
# 237
# 171
# 168
# 13
# 258
# 43
# 263
String
# 8
# 13
# 345
# 290
# 342
# 388
# 482
# 186
# 151
# 434
# 157
# 158
# 161
# 71
# 394
Two Pointer
# 234
# 76
Reservoir Sampling
# 382
Union Find
# 305
Powered by
GitBook
# 111
111
這一題
要算的是root到最近的leaf node的距離，
results matching "
"
No results matching "
"