Leetcode # 859. Buddy Strings

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 # 67. Add Binary

https://leetcode.com/problems/add-binary Solution Time Complexity: O(max(len(a), len(b)) Space Complexity: O(1) (The input and output generally do not count towards the space complexity.) class Soluti ...

         続きを読む

Parsing

Traversal 遍歷 (Using Binary Tree) 請參考:Binary Tree 二元樹 – Traversal 遍歷 範例 Leetcode # 439. Ternary Expression Parser Using Stack 一般來說,優先度相同時,優先順序從左至右 而當優先順序從右至左時,要改為逆序存取 (範例:Leetcode # 439. Ternary ...

         続きを読む
1 ... 29 ... 54
Bitnami