[Algorithm] Recursion 遞迴
定義 Recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem. Recursion solves such recursive problems by using function ...
A1go
[Computer Science] Stack / Heap Memory
- 2022.12.12
- Uncategorized
Stack Memory 使用 stack 後進先出 (Last In First Out) 的概念 用以保存區域變數 (loval variables) 使用暫時性的記憶體空間， 一旦任務完成（函式執行結束後），會自動被抹去 Heap Memory 保存全域變數 (global variables)
Leetcode # 124. Binary Tree Maximum Path Sum
- 2022.12.12
- Binary Tree Depth-First Search LeetCode Recursion
https://leetcode.com/problems/binary-tree-maximum-path-sum/ Solution Time Complexity: O(len(tree)) Space Complexity: O(len(tree)) (The input and output generally do not count towards the space complex ...
Leetcode # 235. Lowest Common Ancestor of a Binary Search Tree
https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree First Solution Time Complexity: O(len(tree)) Space Complexity: O((len(tree)) ^ 2) (The input and output generally do not co ...
Leetcode # 701. Insert into a Binary Search Tree
- 2022.12.11
- Binary Search Tree Binary Tree LeetCode
https://leetcode.com/problems/insert-into-a-binary-search-tree/ Solution Time Complexity: O(log(len(tree))) Space Complexity: O(1) (The input and output generally do not count towards the space comple ...
Leetcode # 101. Symmetric Tree
https://leetcode.com/problems/symmetric-tree/ Solution Time Complexity: O(len(tree)) Space Complexity: O(len(tree)) (The input and output generally do not count towards the space complexity.) class So ...
Leetcode # 112. Path Sum
- 2022.12.09
- Depth-First Search LeetCode Tree
https://leetcode.com/problems/path-sum/ Solution Return True if the tree has a root-to-leaf path Time Complexity: O(len(tree)) Space Complexity: O(len(tree)) (The input and output generally do not cou ...
Leetcode # 323. Number of Connected Components in an Undirected Graph
- 2022.12.09
- Disjoint Set Union LeetCode
https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph Solution: Disjoint Set Union (DSU) Time Complexity: O() Space Complexity: O() (The input and output generally do not ...
Leetcode # 200. Number of Islands
- 2022.12.09
- Disjoint Set Union LeetCode
https://leetcode.com/problems/number-of-islands/ Solution: Disjoint Set Union (DSU) Time Complexity: O(len(grid) * len(grid[0])) Space Complexity: O(len(grid) * len(grid[0])) (The input and output gen ...
Leetcode # 872. Leaf-Similar Trees
- 2022.12.08
- Depth-First Search Python Tree
https://leetcode.com/problems/leaf-similar-trees/ Solution Time Complexity: O(len(tree1 + tree2)) Space Complexity: O(len(tree1 + tree2)) (The input and output generally do not count towards the space ...
