Herr Deng桑的教學blog

C++bitmask陣列切割解Leetcode難題3197  Find the Minimum Area to Cover All Ones II 這是個立方時間的解答，主要採bitmask陣列法表達矩陣，應該沒人這樣做，最快時間已達8ms擊敗100%的C++參與者。 -----...

C++ dp動態規劃速解Leetcode 1277  Count Square Submatrices with All Ones 使用matrix當成state matrix [codes on Leecode] https://leetcode.com/problems/co...

Py3 C++陣列迴圈速解Leetcode 1323  Maximum 69 Number 學程式的第一式，就是要會活用陣列迴圈，足以解Leetcode 1323. Maximum 69 Number  [Py3解請進]

Leetcode 342  Power of Four幾個C++一行解 [codes on Leetcode] https://leetcode.com/problems/power-of-four/solutions/7081839/9-ways-of-bit-manipula...

C++一行解Leetcode 326  Power of Three 利用3的羃次方的因數也是3的羃次方，導出一行C++程式碼 [解答請進]

C++快速模指數計算與prefix sum解Leetcode 2438  Range Product Queries of Powers 先用fast modular exp解Leetcode 2438. Range Product Queries of Powers，這不會殺...

C++ DP速解難題leetcode 3363  Find the Maximum Number of Fruits Collected [Python解請進]

segment tree C++解Leetcode 3479  Fruits Into Baskets III 線段樹(segment tree)是一種進階的資料結構，可以用來解決一些 LeetCode 難題。 線段樹本質上是一棵二元樹；它可以用二元樹來實現，但更常見的是使用陣...

二元搜尋sliding window cpp py3解Leetcode 2106難題Maximum Fruits Harvested After at Most K Steps [C++ solution請進]

Py3  C++奇偶交錯奇偶子數列解Leecode 3201  Find the Maximum Length of Valid Subsequence I 求最長有效子序列，使得 (sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 ==...