[置頂]ECDSA

什麼是ECDSA?

C++ Py3用nth_element, nsmallest解Leetcode 3010 Divide an Array Into Subar...

C++ Py3用nth_element, nsmallest解Leetcode 3010  Divide an Array Into Subarrays With Minimum Cost I

問題簡單，但應該是同類問題入門，先提供幾個簡易解答

[Py3一行解請進]

----

計數排序與greedy 2 pointer解Leetcode 1877 Minimize Maximum Pair Sum in Array

計數排序與greedy 2 pointer解Leetcode 1877  Minimize Maximum Pair Sum in Array 重點是理解為何Greedy方法可行，code很簡單，就排序sort, counting sort, radix sort都來一遍

[Py3 一行解請進]

C C++ Py3 DP與OOP解Leetcode 3573 Best Time to Buy and Sell Stock V

C C++ Py3  DP與OOP解Leetcode 3573  Best Time to Buy and Sell Stock V

[Py3 code請進]

py3 C C++階乘模運算速解Leetcode 3577 Count the Number of Computer Unlocking Pe...

py3 C C++階乘模運算速解Leetcode 3577  Count the Number of Computer Unlocking Permutations

[1-liner Py3請進]

Py3 C++利用Euclid公式達O(n)解Leetcode1925 Count Square Sum Triples

Py3 C++利用Euclid公式達O(n)解Leetcode 1925  Count Square Sum Triples

用數論方法解畢氏定理三角整數解個數，這應該算是Diophantine  Equation中最簡單的例題

[Py3解請進]

Py3 C++ hashmap多項次公式解梯形問題Leetcode 3623 Count Number of Trapezoids I

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 Div...

Py3 C C++ prefix sum解Leetcode 3381  Maximum Subarray Sum With Length Divisible by K

Very similar to Kadane's algorithm

[Py3 code請進]

Py3 C++找出pattern迭代變化解出Leetcode 1015 Smallest Integer Divisible by K

所謂的數論問題，也不一定是是像費馬定理那樣的大問題，能找出數字間的pattern也都是值得玩味的

執行直到 r=(10*r+1)%k==0（其中 k 與 2 和 5 互質），否則返回 -1

[Py3 code請進]

AI人工智慧Keras實作神經網路模型之mnist手寫數字辨識

iPython code請進