Herr Deng桑的教學blog

Py3 CPP多項次公式解梯形問題Leetcode 3623  Count Number of Trapezoids I 數有幾個不同水平梯形，先用hash map數有相同y座標的點，再用多項次公式解題 [Py3解請進]

Py3 C C++ prefix sum解Leetcode 3381  Maximum Subarray Sum With Length Divisible by K Very similar to Kadane's algorithm [Py3 code請進]

所謂的數論問題，也不一定是是像費馬定理那樣的大問題，能找出數字間的pattern也都是值得玩味的 執行直到 r=(10*r+1)%k==0（其中 k 與 2 和 5 互質），否則返回 -1 [Py3 code請進]

iPython code請進

C++用 -1 mask法達到branchless解Leetcode1513  Number of Substrings With Only 1s|Py3 1-liner 其實很容易，想練功，試試一行解，或是把if分岔拿掉 [C++無分岔解請進]

Py3 C++ 2D sweep解Leetcode 2536  Increment Submatrices by One 使用2D掃描，方法為line sweep的2D推廣，方便好用。 [Py3解請進]

C++ Py3 Euclidean Algorithm解Leetcode 2169  Count Operations to Obtain Zero [Py3一行解請進]

Py3 C++導出遞迴公式解難題Leetcode1611  Minimum One Bit Operations to Make Integers Zero從導出公式到寫出code，一次完成解Leetcode難題 [C++一行解請進]

C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array [Py3一行解請進]

py3 cpp Line sweep解Leetcode 3346  Maximum Frequency of an Element After Performing Operations I 使用 line sweep不用排序，可得線性解 [Py3解請進]