[置頂]ECDSA

什麼是ECDSA?

C, Py3, C++解Leetcode 3612 與難題3614 Process String with Special Operations

C Py3 C++解Leetcode 3612 與難題3614 Process String with Special Operations

一個字串問題Leetcode 3612，用C++或Python是易如反掌，用C語言就難多了，然而這個解題經驗，順便用來解所謂hard 3614. Process String with Special Operations II

C++Binary Lifting 視覺化解說 Leetcode

Beats 100%|C++ BFS LCA binary lifting與模指數運算解Leetcode難題3559 Number of Ways to Assign Edge Weights II

#anwendeng 

Beats 100%|C++ BFS LCA binary lfting與模指數運算解Leetcode難題3559  Number of Ways to Assign Edge Weights II

- Adjacency-list: array linked Lists 

- BFS - construct parent[], level[]

- LCA- binary lifting - distance

- Fast modular power , pow2

- query call distance & pow2 to give answer

C++實作快速模指數運算LeetCode、Competitive Programming

#cplusplus 實作快速模指數運算

許多刷題如#Leetcode 需要有實作#快速模指數 運算的#modular #exponentiation 技能 #binary  method

計算 x**N (mod P)用for迴圈跑N次其實是很慢!特別N很大

黑柴遇上故宮至善園：YOLOE AI 能認出拱橋跟魚？

Google Gemini AI Studio 完全攻略：免費 API Key 申請與 Colab 實測

Whisper與google genAI api完成逐字稿

LeetCode 3689 | 0ms C++ minmax & Python 1-Liner

C++ #minmax 0ms Py #1liner 速解Leetcode 3689  Maximum Total Subarray Value I 

0ms branchless|C++ Py3 2-pointer速解Leetcode 2161 Partition Array According to Given Pivot

C++ Py3 2pointer速解Leetcode2161  Partition Array According to Given Pivot

影片說明解法Py3用迴圈 list 相加。

[C++branchless 0ms請進]