[置頂]ECDSA

什麼是ECDSA?

C++ py3 C Rust速解Leetcode 1526 Minimum Number of Increments on Subarrays ...

C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array

[Py3一行解請進]

python requests讀取台積電股票json資訊爬蟲練習

url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"

py3 C++ Line sweep解Leetcode 3346 Maximum Frequency of an Element After ...

py3 cpp Line sweep解Leetcode 3346  Maximum Frequency of an Element After Performing Operations I

使用 line sweep不用排序，可得線性解

[Py3解請進]

Py3 C++計數bitmask與2 pointers速解Leetcode2273 Find Resultant Array After Re...

Py3 C++計數bitmask與2 pointers速解Leetcode2273  Find Resultant Array After Removing Anagrams

字串長度最長也只有10，四個bits一組，用bitmask解題

-----

The maximum length of a string is only 10, and four bits are grouped together. Use bitmask to solve the problem.

[Py3 code請進]

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解請進]