ベイビー・アイラブユー
なぁ 旅に出ないか なぁ 海を見ないか 通り過ぎゆく日々の中 君に会い俺の中の何かがはじけた 伝えたくて 言えなくて それがまた苦しくて あ～どおすりゃいい 遠い空見上げて naturally そんな日は 変わらない diary 目にはうつらないもの 幸せの赤い糸 君の小指に運ぶ風 薬指に誰かの影 聞きたくて 聞けなくて それがまた jealousy で I’m so crazy 今は ...
A1go
Leetcode # 328. Odd Even Linked List
- 2022.12.06
- ★★ Medium LeetCode Multiple Assignment
https://leetcode.com/problems/odd-even-linked-list/ Solution Time Complexity: O(len(linked_list)) Space Complexity: O(1) (The input and output generally do not count towards the space complexity.) 注意： ...
[食譜] 沙威瑪
孜然粉, 匈牙利甜椒粉, 肉桂粉：３：４：１ ※ 肉桂粉太多會苦 沙拉 ( + 千島沙拉) 麵包／吐司 稍微烤得脆脆的 洋蔥粗切片 ( + 番茄切片)
Leetcode # 203. Remove Linked List Elements
https://leetcode.com/problems/remove-linked-list-elements/ Solution 1 class Solution: def removeElements(self, head: Optional[ListNode], val: int) -> Optional[ListNode]: new_head = head while new_h ...
Leetcode # 141. Linked List Cycle
- 2022.12.05
- Floyd's tortoise and hare LeetCode Linked List
https://leetcode.com/problems/linked-list-cycle/ Solution Time Complexity: O(len(linked_list)) Space Complexity: O(1) (The input and output generally do not count towards the space complexity.) class ...
Leetcode # 102. Binary Tree Level Order Traversal
- 2022.12.04
- Breadth-First Search LeetCode
https://leetcode.com/problems/binary-tree-level-order-traversal/ Solution Time Complexity: O(len(tree)) Space Complexity: O(len(tree)) (The input and output generally do not count towards the space co ...
[Python] 逆序存取 (for e in lst[::-1])
- 2022.12.04
- Python
for e in lst[::-1]
Leetcode # 589. N-ary Tree Preorder Traversal
- 2022.12.04
- Depth-First Search LeetCode
https://leetcode.com/problems/n-ary-tree-preorder-traversal/ Solution Time Complexity: O(len(tree)) Space Complexity: O(len(tree)) (The input and output generally do not count towards the space comple ...
BFS and DFS
- 2022.12.04
- Breadth-First Search Depth-First Search Tree
BFS 和 DFS 為用以在 tree 中搜尋特定 node 的演算法 Breadth-First Search 廣度優先搜尋 Depth-First Search 深度優先搜尋 相關文章：Binary Tree 二元樹 Iterative Implementation BFS：使用 Queue Template queue = collections.deque([root]) w ...
Leetcode # 242. Valid Anagram
- 2022.12.04
- LeetCode
https://leetcode.com/problems/valid-anagram/ Solution Time Complexity: O(max(len(s), len(t))) Space Complexity: O(max(len(s), len(t))) (The input and output generally do not count towards the space co ...
