C C++ GCD LCM解Leetcode難題2197 Replace Non Coprime Numbers in Array
用binary Euclidean algorithm定義gcd，然後定義lcm之後就是用stack
[Py3 code請進]
herrDeng網內搜尋
自訂搜尋
2025年9月16日 星期二
2025年9月14日 星期日
C++ Trie prefix tree解母音拼字Leetcode 966 Vowel Spellchecker
C++ Trie prefix tree解母音拼字Leetcode 966 Vowel Spellchecker
如果unordered_set, unordered_map有其他替方案就用，能用Trie去解也算是一種成就
--------
If there are alternatives to unordered_set and unordered_map, use them. Being able to solve them with Trie is also an achievement.
訂閱：
意見 (Atom)
熱門文章
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
連續複利
-
py3 cpp Line sweep解Leetcode 3346 Maximum Frequency of an Element After Performing Operations I 使用 line sweep不用排序，可得線性解 [Py3解請進]
-
C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array [Py3一行解請進]
-
Py3 C++導出遞迴公式解難題Leetcode1611 Minimum One Bit Operations to Make Integers Zero從導出公式到寫出code，一次完成解Leetcode難題 [C++一行解請進]
-
int a[]={21, 23, 57, 13 ,17, 6}; float average; average=?
-
C++ Py3 Euclidean Algorithm解Leetcode 2169 Count Operations to Obtain Zero [Py3一行解請進]
