Linked List
- 2023.07.25
- Linked List
因為 Python 多重賦值 (Multiple Assignment) 時的計算順序導致的錯誤 Leetcode # 2. Add Two Numbers ⭐️ Leetcode # 206. Reverse Linked List 追加 node 適切的方式 使用 pre Leetcode # 206. Reverse Linked List 在迴圈繼續時才追加 Leetcode # 2. A ...
Leetcode # 21. Merge Two Sorted Lists
- 2023.07.25
- ★ Easy LeetCode Linked List
https://leetcode.com/problems/merge-two-sorted-lists Solution Time Complexity: O(len(list1) + len(list2)) Space Complexity: O(1) (The input and output generally do not count towards the space complexi ...
[WordPress] 在 LION BLOG 佈景主題中去掉 Table 框線的方法
<table style=”border-style: none;” border=”1″> … </table> <td style=”border-color: #ffffff;“> … </td> 常用 Templete 1
Leetcode # 439. Ternary Expression Parser
- 2023.07.25
- ★★ Medium LeetCode Parsing
- TernaryConditionalOperator
https://leetcode.com/problems/ternary-expression-parser 三元條件運算子 Ternary Conditional Operator variable = condition ? value_if_true : value_if_false or condition ? expr1 : expr2 Solution (Stack) 根 ...
Leetcode # 43. Multiply Strings
- 2023.07.24
- ★★ Medium Big Number Can Be Better LeetCode Mathematics
https://leetcode.com/problems/multiply-strings First Solution M := len(num1) N := len(num2) Time Complexity: O(M * N + N * (M + N)) = O(M * N + N ** 2) Space Complexity: O(N * (M + N)) (若在長乘法乘算途中即做加法， ...
ASCII
- 2023.07.24
- Programming Techniques / Tools
0-9 48-57 A-Z 65-90 a-z 97-122
Leetcode # 1056. Confusing Number
- 2023.07.24
- LeetCode Mathematics
https://leetcode.com/problems/confusing-number Solution 問題：n 是否顛倒後仍是一組數字並且不等於 n ？ Time Complexity: O(log(n)) Space Complexity: O(1) (The input and output generally do not count towards the space compl ...
Floating-Point Error
- 2023.07.24
- Programming Techniques / Tools
- FloatingPointError
ε Epsilon Python float_info.epsilon 2.220446049250313e-16 #FloatingPointError
Leetcode # 859. Buddy Strings
- 2023.07.24
- LeetCode
https://leetcode.com/problems/buddy-strings Solution 交換兩個 character 後 s 和 gaol 會一樣 ⇒ 回傳 True s 和 goal 只有在 i, j 的兩個 character 不一樣 (s[i] != goal[i] and s[j] != goal [j])， 且 s[i] = goal[j], s[j] = goal[i ...
Leetcode # 50. Pow(x, n)
- 2023.07.24
- LeetCode Mathematics Memoization
https://leetcode.com/problems/powx-n Solution (Memoization) Time Complexity: O(log(n)) Space Complexity: O(log(n)) (The input and output generally do not count towards the space complexity.) class Sol ...
