Py3 C++陣列迴圈速解Leetcode 1323 Maximum 69 Number

Py3 C++陣列迴圈速解Leetcode 1323  Maximum 69 Number

學程式的第一式，就是要會活用陣列迴圈，足以解Leetcode 1323. Maximum 69 Number 

[Py3解請進]

Leetcode 342 Power of Four幾個C++一行解

Leetcode 342  Power of Four幾個C++一行解

[codes on Leetcode]https://leetcode.com/problems/power-of-four/solutions/7081839/9-ways-of-bit-manipulation-1-liner-beats-100/

[bit/ bitmask playlist]https://www.youtube.com/watch?v=Hw1fnQA8Nk8&list=PLYRlUBnWnd5K8FlzJ6tOswqQcsk7R1Duh

C++一行解Leetcode 326 Power of Three

C++一行解Leetcode 326  Power of Three

利用3的羃次方的因數也是3的羃次方，導出一行C++程式碼

[解答請進]

C++快速模指數計算與prefix sum解Leetcode 2438 Range Product Queries of Powers

C++快速模指數計算與prefix sum解Leetcode 2438  Range Product Queries of Powers

先用fast modular exp解Leetcode 2438. Range Product Queries of Powers，這不會殺雞用牛刀?

-----

First, use fast modular exp to solve Leetcode 2438. Range Product Queries of Powers. This will not be an overkill?

[codes on Leetcode]https://leetcode.com/problems/range-product-queries-of-powers/solutions/7066112/fast-modular-exp-prefix-sum-dp-precompute-beats-100/