C++ Py3 計數排序與partial sum解Leetcode 2300 Successful Pairs of Spells and ...

C++ Py3  計數排序與partial sum解Leetcode 2300  Successful Pairs of Spells and Potions

Portions的極大值小於等於10萬是可進行記數排序的關鍵，既然可以採用記數排序，後面的二元搜尋也可以透過partial sum的手法加速。

[Py3 code請進]

Py3 C++ C 2pointer速解Leetcode 11Container With Most Water

Py3 C++ C 2pointer速解Leetcode 11Container With Most Water

[Py3 code請進]

C++ Pascal三角與模10算術解Leetcode 2221 Find Triangular Sum of an Array(含Py3 Code)

C++ Pascal三角與模10算術解Leetcode 2221  Find Triangular Sum of an Array

如果採用有支援非常長int的程式語言，mod 10算術就整個省略，就用Pascal三角的性質，可得快速解

Py3 C++ dp動態規劃解Leetcode 1039 Minimum Score Triangulation of Polygon

Py3 C++ dp動態規劃解Leetcode 1039  Minimum Score Triangulation of Polygon

Py3 C++ dp動態規劃解Leetcode 1039  Minimum Score Triangulation of Polygon

凸多邊形三角化的問題，題目看起來很幾何，解法用動態規劃，多邊形的切割其實也是divide and conquer.

 [py3解請進]

Py3 C++ DP動態規劃速解Leetcode 120 Triangle

Py3 C++ DP速解Leetcode 120  Triangle

這題就是用動態規劃解，表列法比較容易

[Py3解請進]

C C++ GCD LCM解Leetcode難題2197 Replace Non Coprime Numbers in Array[含Py3 code]

C C++ GCD LCM解Leetcode難題2197  Replace Non Coprime Numbers in Array

用binary Euclidean algorithm定義gcd，然後定義lcm之後就是用stack

[Py3 code請進]

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.

[codes on Leetcode]https://leetcode.com/problems/vowel-spellchecker/solutions/7187402/vowel-bitmask-trie-vs-hash-tables-15ms-beats-100/

C++示範bitset取代hashset解Leetcode 1733 Minimum Number of People to Teach(含Py3 code)

C++示範bitset取代hashset解Leetcode 1733  Minimum Number of People to Teach

C++ STL的unordered_set與bitset都能解這題，但執行效率差很多，有誰寫C++其執行效能要比類似的Python code還要慢上好久倍?用hashset就如此

[Python code請進 ]

Py3 C++算術建構解1317 Convert Integer to the Sum of Two No Zero Integers

Py3  C++算術建構解1317  Convert Integer to the Sum of Two No Zero Integers

[Py3解請進]

C++C py3 log4 prefix sum, bits解Leetcode難題3495 Minimum Operations to Mak...

C++C py3 log4 prefix sum/bits解Leetcode難題3495  Minimum Operations to Make Array Elements Zero

ceil(log4(x)) 可以透過 clz 計算；將 expSum 定義為部分和來計算。

[Py3 code請進]