[置頂]ECDSA

什麼是ECDSA?

Py3 C++速解Leetcode 3446 Sort Matrix by Diagonals/with Py3 code

Py3 C++速解Leetcode 3446  Sort Matrix by Diagonals

矩陣問題都是很好的迴圈、陣列練習，又加上排序那就是很好的練習題

[Py3 code請進]

C++ dp動態規劃解Leetcode 3459 Length of Longest V Shaped Diagonal Segment

C++ dp動態規劃解Leetcode 3459  Length of Longest V Shaped Diagonal Segment

採DP動態規劃迭代版本解難題，需要定義V-shaped distance

------

Using the DP dynamic programming iterative version, it is necessary to define the V-shaped distance

[codes on Leetcode]https://leetcode.com/problems/length-of-longest-v-shaped-diagonal-segment/solutions/7126168/dp-recursive-dfs-or-iteration-beats-100/

[DP動態規劃Playlist]https://www.youtube.com/watch?v=30yq3fmE6E8&list=PLYRlUBnWnd5K_XYUesV9oc6M9ONXII61T

Py3 C++畢氏定理速解Leetcode 3000 Maximum Area of Longest Diagonal Rectangle

Py3 C++畢氏定理速解Leetcode 3000  Maximum Area of Longest Diagonal Rectangle

Py3 C++ Pythagorean Theorem Quick Solution Leetcode 3000 Maximum Area of​​ Longest Diagonal Rectangle

[codes on Leetcode]https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle/solutions/7122597/easy-1-pass-vs-max-with-custom-cmp-c-py3-beats-100/

[Leetcode playlist]https://www.youtube.com/watch?v=VfRVKO7El9w&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk

Py3 C++ sliding window速解Leetcode1493 Longest Subarray of 1's After Dele...

Py3 C++ sliding window速解Leetcode1493  Longest Subarray of 1's After Deleting One Element

示範如何從一般  sliding window解答簡化成單迴圈解答解無if

[Py3解在此，請進]

C++bitmask陣列切割解Leetcode難題3197 Find the Minimum Area to Cover All Ones II

C++bitmask陣列切割解Leetcode難題3197  Find the Minimum Area to Cover All Ones II

這是個立方時間的解答，主要採bitmask陣列法表達矩陣，應該沒人這樣做，最快時間已達8ms擊敗100%的C++參與者。

---------------

This is a cubic time solution, which mainly uses the bitmask array method to express the matrix. It is unlikely that anyone would do this. The fastest time has reached 8ms, beating 100% of the C++ participants.

[codes on Leetcode]https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-ii/solutions/7111740/bitmask-1d-array-for-grid-its-transpose-deal-with-6-cases-8ms-beats-100/

C++ dp動態規劃速解Leetcode 1277 Count Square Submatrices with All Ones

C++ dp動態規劃速解Leetcode 1277  Count Square Submatrices with All Ones

使用matrix當成state matrix

[codes on Leecode]https://leetcode.com/problems/count-square-submatrices-with-all-ones/solutions/7101478/reuse-matrix-as-state-matrix-beats-100/

[DP play list]https://www.youtube.com/watch?v=30yq3fmE6E8&list=PLYRlUBnWnd5K_XYUesV9oc6M9ONXII61T

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++程式碼

[解答請進]